Total unimodularity applications in bi-objective discrete optimization

DOI10.1016/0167-6377(92)90064-AMaRDI QIDQ1198627zbMATH OpenFDO

Authors Panagiotis Kouvelis, Robert C. Carlson

Publication date 16 January 1993

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

Full work available at URL https://doi.org/10.1016/0167-6377(92)90064-A

zbMATH Keywords

bi-objective linear programsbiobjective integer programscombinatorial optimizationconcave integer programsmultiobjective programmingtotal unimodularity

Mathematics Subject Classification ID

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

Recommendations

• Two simple applications of the unmodularity property
• Total unimodularity and the Euler-subgraph problem
• Totally unimodular stochastic programs
• A direct constructive proof of a known result on total unimodularity, and a characterisation of related partitions
• scientific article; zbMATH DE number 221298

Cites work

• Algorithms for the vector maximization problem
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• scientific article; zbMATH DE number 3121293 (Why is no real title available?)
• scientific article; zbMATH DE number 3495859 (Why is no real title available?)
• Linear Multiparametric Programming by Multicriteria Simplex Method
• 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

Cited in

(4)

• Two simple applications of the unmodularity property
• A fast interactive solution method for large capital expenditure selection problems
• Totally unimodular stochastic programs
• Finding total unimodularity in optimization problems solved by linear programs

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

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