Note on combinatorial optimization with max-linear objective functions

DOI10.1016/0166-218X(93)90043-NzbMATH Open0777.90046OpenAlexW2098120964MaRDI QIDQ1803670FDOQ1803670

Francesco Maffioli, Sung-Jin Chung, Horst W. Hamacher, Katta G. Murty

Publication date: 29 June 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(93)90043-n

zbMATH Keywords

lower boundsmulticriteria optimizationbranch-and-boundstrongly NP-hardmax-linear combinatorial problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Some NP-complete problems in quadratic and nonlinear programming
• The matroidal knapsack: A class of (often) well-solvable problems
• An approach to nonlinear programming
• Complexity of some parametric integer and network programming problems
• Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems
• Multi-constrained matroidal knapsack problems
• Algorithms for flows with parametric capacities
• A new exchange property for matroids and its application to max-min-problems

Cited In (10)

• Geometric methods to solve max-ordering location problems
• A Benders decomposition approach to product location in carousel storage systems
• Three algorithms for bicriteria integer linear programs
• Optimization of an SMD placement machine and flows in parametric networks
• Title not available (Why is that?)
• Multicriteria planar location problems
• On spanning tree problems with multiple objectives
• A note on \(K\) best network flows
• A discussion of scalarization techniques for multiple objective integer programming
• Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach

Recommendations

• Multi‐objective combinatorial optimization problems: A survey 👍 👎
• Solving combinatorial problems with combined min-max-min-sum objective and applications 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Note on combinatorial optimization with max-linear objective functions

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