Finding Total Unimodularity in Optimization Problems Solved by Linear Programs

DOI10.1007/11841036_30zbMath1131.90441OpenAlexW2110709471MaRDI QIDQ5449538

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)

Related Items (2)

Parallel machine problems with equal processing times: a survey ⋮ A decomposition scheme for single stage scheduling problems

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