A branch and bound algorithm for solving separable convex integer programming problems
References (29)
- et al.
Nonlinear integer programming
Comps Math. Applic.
(1975) A general algorithm for the optimal distribution of effort
Mgmt Sci.
(1962)The optimum distribution of effort
Ops Res.
(1953)- et al.
Applied Dynamic Programming
(1962) Solving Discrete-Variable Multiople-Constraint Nonlinear Programs: The Decision-State Method
A method of solving redundancy optimization problems
IEEE Trans. Reliability
(1971)- et al.
Integer programming formulation of constrained reliability problems
Mgmt Sci.
(1967) - et al.
Determining optimal reorder intervals in capacitated production distribution systems
Mgmt Sci.
(1988) - et al.
Establishing consistent and realistic reorder intervals in production-distribution systems
Ops Res.
(1985) - et al.
Mathematical Programming in Statistics
(1981)
Nonlinear integer programming algorithms: a survey
Opsearch
A suevey of method for pure nonlinear integer programming
Mgmt Sci.
Further reduction of zero-one polynomial problems to zero-one linear programming problems
Ops Res.
Converting the 0–1 polynomial programming problems to a 0–1 linear program
Ops Res.
Cited by (0)
- †
Won J. Lee is an assistant professor of Management at Marquette University. He obtained a B.B.A. from Sungkyunkwan University, an M.B.A. from University of Michigan, and a Ph.D. from Indiana University. His current research interests are in applied management science, production/marketing interface, and inventory and lot sizing.
- §
A. Victor Cabot is a Professor in the Decision and Information Systems in the School of Business at Indiana University. He holds a BSIE from the University of Miami and an MSIE and Ph.D. from Northwestern University. Professor Cabot has held visiting positions at the University of Grenoble and the Naval Postgraduate School.
- ¶
M. A. Venkataramanan is an Associate Professor of Decision and Information Systems in the School of Business at Indiana University. His current teaching and research interests are in applied operations research, network programming and high speed computing.