Note on combinatorial optimization with max-linear objective functions

DOI10.1016/0166-218X(93)90043-NMaRDI QIDQ1803670zbMATHOpenAlexFDO

Authors Sung-Jin Chung, Horst W. Hamacher, Francesco Maffioli, 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)

Recommendations

• scientific article; zbMATH DE number 26845
• Solving combinatorial problems with combined min-max-min-sum objective and applications
• scientific article; zbMATH DE number 1530340
• scientific article; zbMATH DE number 2160609
• Multi‐objective combinatorial optimization problems: A survey

Cites work

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

Cited in

(11)

• Method of solution of extremal combinatorial problems with nonlinear structure
• A note on \(K\) best network flows
• Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
• Three algorithms for bicriteria integer linear programs
• On spanning tree problems with multiple objectives
• scientific article; zbMATH DE number 671947 (Why is no real title available?)
• A discussion of scalarization techniques for multiple objective integer programming
• A Benders decomposition approach to product location in carousel storage systems
• Optimization of an SMD placement machine and flows in parametric networks
• Multicriteria planar location problems
• Geometric methods to solve max-ordering location problems

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)