scientific article; zbMATH DE number 3526452
From MaRDI portal
Publication:4103327
zbMath0336.90038MaRDI QIDQ4103327
No author found.
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A branch and bound algorithm for extreme point mathematical programming problems, The reduced cost branch and bound algorithm for mixed integer programming, Ein kapazitiver enumerationsalgorithmus für lineare opti- mierungsprobleme mit ganzzahligkeitsbedingungen, New constructs for the description of combinatorial optimization problems in algebraic modeling languages, Experiments in mixed-integer linear programming, Experiments in integer programming, An integer programming approach to a class of combinatorial problems, Investigation of some branch and bound strategies for the solution of mixed integer linear programs, Postoptimality analysis in integer programming by implicit enumeration: The mixed integer case, Improved penalty calculations for a mixed integer branch-and-bound algorithm, On the calculation of true and pseudo penalties in multiple choice integer programming, Valid integer polytope (VIP) penalties for branch-and-bound enumeration, Capacitated lot-sizing and scheduling by Lagrangean relaxation, Branch and bound, integer, and non-integer programming, Experiments in mixed-integer linear programming using pseudo-costs, A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems, Computational comparison on the partitioning strategies in multiple choice integer programming, A note on modeling multiple choice requirements for simple mixed integer programming solvers, The best parameter subset using the Chebychev curve fitting criterion, An ideal column algorithm for integer programs with special ordered sets of variables, An algorithm for optimizing network flow capacity under economies of scale, Implementations of special ordered sets in MP software, Penalty computations for the set partitioning problem, Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming
