A branch and bound algorithm for solving separable convex integer programming problems

Keywords

Mathematical optimization, Branch and cut, Branch and bound, Separable space, Mathematics

References

• Construction of nonlinear programming test problemsJ. B. Rosen, Satomi Suzuki — 1965
• A Survey of Methods for Pure Nonlinear Integer ProgrammingMary W. Cooper — 1981
• Establishing Consistent and Realistic Reorder Intervals in Production-Distribution SystemsWilliam Maxwell, John A. Muckstadt — 1985
• Branch and Bound Experiments in Convex Nonlinear Integer ProgrammingOmprakash K. Gupta, A. Ravindran — 1985
• Technical Note - Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear ProgramFred Glover, Eugene Woolsey — 1974
• Nonlinear and Dynamic ProgrammingArthur Wouk — 1965
• Letter to the Editor - Reduction of Integer Polynomial Programming Problems to Zero-One Linear Programming ProblemsLawrence J. Watters — 1967
• Determining optimal reorder intervals in capacitated production-distribution systemsP JACKSON, William Maxwell, John A. Muckstadt — 1988
• Pracniques: construction of nonlinear programming test problemsJ. B. Rosen, Satomi Suzuki — 1965
• Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming ProblemsFred Glover, Eugene Woolsey — 1973
• A Method of Solving Redundancy Optimization ProblemsK.B. Misra — 1971
• Design and Testing of a Generalized Reduced Gradient Code for Nonlinear ProgrammingLeon S. Lasdon, Allan D. Waren, Arvind K. Jain — 1978
• A hybrid approach to discrete mathematical programmingRoy E. Marsten, Thomas L. Morin — 2015
• The use of dynamic programming methodology for the solution of a class of nonlinear programming problemsMary W. Cooper — 1980
• A branch and bound algorithm for solving a class of nonlinear integer programming problemsA. Victor Cabot, Ş. Selçuk Erengüç — 1986
• Minimization of non-linear separable convex functionals†A. Charnes, C. E. Lemke — 1954
• The Optimum Distribution of EffortB. O. Koopman — 1953
• An Algorithm for Nonlinear Knapsack ProblemsThomas L. Morin, Roy E. Marsten — 1976
• Integer Programming Formulation of Constrained Reliability ProblemsFrank A. Tillman, John M. Liittschwager — 1967
• A General Algorithm for the Optimal Distribution of EffortWilliam Karush — 1962

Cited by

• A discrete dynamic convexized method for nonlinear integer programmingWenxing Zhu, Hong Fu Fan — 2009
• One more step in the methods of integration of tann ax and cot" axOZCAN BAYTEKIN — 1997
• A critical review of discrete filled function methods in solving nonlinear discrete optimization problemsSiew Fang Woon, Volker Rehbock — 2010
• Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programmingWenxing Zhu, M. Montaz Ali — 2009
• Genetic algorithm for non-linear mixed integer programming problems and its applicationsTakao Yokota, Mitsuo Gen, Yinxiu Li — 1996
• Global algorithms for nonlinear discrete optimization and discrete-valued optimal control problemsSiew Fang Woon — 2009
• A discrete hybrid differential evolution algorithm for solving integer programming problemsHong Li, Li Zhang — 2014
• No Special Schemes Are Needed for Solving Software Reliability Optimization ModelsHüseyin Sarper — 1995
• A Min-Max-Sum Resource Allocation Problem and Its ApplicationsSelçuk Karabatı, Panagiotis Kouvelis, Gang Yu — 2001
• A New Nonparametric Filled Function Method for Integer Programming Problems with ConstraintsSuxia Ma, Yuelin Gao, Bo Zhang — 2022

Related papers

• A dynamic programming branch and bound algorithm for pure integer programmingR. J. Aust — 1976
• A parallel integer linear programming algorithmRochelle L. Boehning, Ralph Butler, Billy E. Gillett — 1988
• A Note on Branch and Bound Algorithm for Integer Linear ProgrammingSyed Inayatullah, Wajiha Riaz, Hafsa Athar Jafree — 2019
• Investigation of some branch and bound strategies for the solution of mixed integer linear programsGautam Mitra — 1973
• A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic ProgramsJuan Pablo Vielma, Shabbir Ahmed, George L. Nemhauser — 2008
• Branch and Bound Experiments in Convex Nonlinear Integer ProgrammingOmprakash K. Gupta, A. Ravindran — 1985
• An implicit branch-and-bound algorithm for mixed-integer-linear programmingYouling Lin, Larry M. Austin, James R. Burns — 1990
• A new branching rule for the branch and bound algorithm for solving nonlinear integer programming problemsFrank Körner — 1988
• A branch-and-bound algorithm for 0-1 parametric mixed integer programmingYoshiaki Ohtake, Naonori Nishida — 1985
• Branch-and-bound for bi-objective integer programmingSophie N. Parragh, Fabien Tricoire — 2018