Total unimodularity applications in bi-objective discrete optimization

DOI10.1016/0167-6377(92)90064-AzbMath0764.90061MaRDI QIDQ1198627

Robert C. Carlson, Panagiotis Kouvelis

Publication date: 16 January 1993

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationmultiobjective programmingtotal unimodularitybi-objective linear programsbiobjective integer programsconcave integer programs

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items (2)

Two simple applications of the unmodularity property ⋮ A fast interactive solution method for large capital expenditure selection problems

Cites Work

• Unnamed Item
• Unnamed Item
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• Theory and algorithms for linear multiple objective programs with zero–one variables
• Linear Multiparametric Programming by Multicriteria Simplex Method
• Algorithms for the vector maximization problem
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables

This page was built for publication: Total unimodularity applications in bi-objective discrete optimization