Three algorithms for bicriteria integer linear programs

DOI10.1007/BF01720321zbMath0822.90117OpenAlexW1972863585MaRDI QIDQ1804551

P. Neumayer, Dietmar Schweigert

Publication date: 12 June 1995

Published in: OR Spektrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01720321

zbMATH Keywords

multiobjective programminginteger linear programmingbi-objective optimizationminimax functionbicriteria integer programmingcontinuous quadratic objective function

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29) Linear programming (90C05)

Related Items (5)

An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems ⋮ An improved algorithm for solving biobjective integer programs ⋮ Algorithm robust for the bicriteria discrete optimization problem ⋮ Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems ⋮ A reduction algorithm for integer multiple objective linear programs

Cites Work

• Algorithms for nonlinear integer bicriterion problems
• Linear multiobjective programming
• Note on combinatorial optimization with max-linear objective functions
• Proper efficiency and the theory of vector maximization
• Bicriteria Transportation Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Three algorithms for bicriteria integer linear programs