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

DOI10.2307/2581298zbMath0481.90060OpenAlexW4233421478MaRDI QIDQ3939595

Peter Mark Pruzan, Rainer E. Burkard, Jakob Krarup

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

minimaxoptimalityoptimal solutionsBoolean optimizationminisumstrict efficiencymulticriteria 0-1 programmingcombination of sum and bottleneck objective functions

Mathematics Subject Classification ID

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

Related Items (11)

Zero-one programming with multiple criteria ⋮ Location problems with costs being sums of powers of Euclidean distances ⋮ Multiobjective analysis of facility location decisions ⋮ Complexity of discrete multicriteria problems ⋮ 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 ⋮ Efficiency and time-cost-tradeoffs in transportation problems ⋮ Multiobjective 0-1 integer programming for the use of sugarcane residual biomass in energy cogeneration ⋮ An efficient heuristic algorithm for the bottleneck traveling salesman problem ⋮ A method for finding the set of non-dominated vectors for multiple objective integer linear programs ⋮ A branch and bound algorithm for mixed zero-one multiple objective linear programming ⋮ An interactive procedure for multiple objective integer linear programming problems

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