Finding Total Unimodularity in Optimization Problems Solved by Linear Programs

DOI10.1007/11841036_30MaRDI QIDQ5449538zbMATH OpenOpenAlexFDO

Authors Mathilde Hurand, Christoph Dürr

Publication date 11 March 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27)

Recommendations

• Finding total unimodularity in optimization problems solved by linear programs
• On the uniqueness of solutions to linear programs
• Determination of optimal vertices from feasible solutions in unimodular linear programming
• On the uniqueness of the optimal solution in the linear programming
• A unimodular problem of integer programming
• Unicity in linear optimization
• Unified approaches for solvable and unsolvable linear complementarity problems
• Optimization problems with unimodal functions in max-separabal constraints
• Global optimization of linear multiplicative programming using univariate search
• scientific article; zbMATH DE number 1261905

Cited in

(6)

• Determination of optimal vertices from feasible solutions in unimodular linear programming
• Parallel machine problems with equal processing times: a survey
• Unifying Condition Numbers for Linear Programming
• Initial ideals of unimodular integer programs
• Finding total unimodularity in optimization problems solved by linear programs
• A decomposition scheme for single stage scheduling problems

This page was built for publication: Finding Total Unimodularity in Optimization Problems Solved by Linear Programs

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