Efficiency and Optimality in Minisum, Minimax 0-1 Programming Problems

DOI10.2307/2581298MaRDI QIDQ3939595zbMATH OpenOpenAlexFDO

Authors Rainer E. Burkard, Jakob Krarup, Peter Mark Pruzan

Publication date 1982

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2581298

zbMATH Keywords

Boolean optimizationcombination of sum and bottleneck objective functionsminimaxminisummulticriteria 0-1 programmingoptimal solutionsoptimalitystrict efficiency

Mathematics Subject Classification ID

Boolean programming (90C09) Sensitivity, stability, parametric optimization (90C31)

Cited in

(11)

• Zero-one programming with multiple criteria
• Location problems with costs being sums of powers of Euclidean distances
• Efficiency and time-cost-tradeoffs in transportation problems
• A branch and bound algorithm for mixed zero-one multiple objective linear programming
• An interactive procedure for multiple objective integer linear programming problems
• A method for finding the set of non-dominated vectors for multiple objective integer linear programs
• An efficient heuristic algorithm for the bottleneck traveling salesman problem
• Multiobjective analysis of facility location decisions
• Complexity of discrete multicriteria problems
• Multiobjective 0-1 integer programming for the use of sugarcane residual biomass in energy cogeneration
• Algorithms and the calculation of Nash equilibria for multi-objective control of time-discrete systems and polynomial-time algorithms for dynamic c-games on networks

This page was built for publication: Efficiency and Optimality in Minisum, Minimax 0-1 Programming Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3939595)