The following pages link to (Q4103327):
Displaying 24 items.
- Branch and bound, integer, and non-integer programming (Q537592) (← links)
- Implementations of special ordered sets in MP software (Q792884) (← links)
- A branch and bound algorithm for extreme point mathematical programming problems (Q1078072) (← links)
- The reduced cost branch and bound algorithm for mixed integer programming (Q1085067) (← links)
- Experiments in integer programming (Q1137509) (← links)
- On the calculation of true and pseudo penalties in multiple choice integer programming (Q1183620) (← links)
- Capacitated lot-sizing and scheduling by Lagrangean relaxation (Q1198326) (← links)
- A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems (Q1255881) (← links)
- Computational comparison on the partitioning strategies in multiple choice integer programming (Q1266577) (← links)
- Penalty computations for the set partitioning problem (Q1309877) (← links)
- Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming (Q1603339) (← links)
- An algorithm for optimizing network flow capacity under economies of scale (Q1843381) (← links)
- New constructs for the description of combinatorial optimization problems in algebraic modeling languages (Q1918922) (← links)
- Valid integer polytope (VIP) penalties for branch-and-bound enumeration (Q1977646) (← links)
- A note on modeling multiple choice requirements for simple mixed integer programming solvers (Q2563892) (← links)
- Ein kapazitiver enumerationsalgorithmus für lineare opti- mierungsprobleme mit ganzzahligkeitsbedingungen (Q3204333) (← links)
- The best parameter subset using the Chebychev curve fitting criterion (Q3662506) (← links)
- An ideal column algorithm for integer programs with special ordered sets of variables (Q3666590) (← links)
- Postoptimality analysis in integer programming by implicit enumeration: The mixed integer case (Q4060730) (← links)
- Improved penalty calculations for a mixed integer branch-and-bound algorithm (Q4079323) (← links)
- Experiments in mixed-integer linear programming using pseudo-costs (Q4136935) (← links)
- Experiments in mixed-integer linear programming (Q5642449) (← links)
- An integer programming approach to a class of combinatorial problems (Q5663651) (← links)
- Investigation of some branch and bound strategies for the solution of mixed integer linear programs (Q5675545) (← links)
