A mixed-integer linear programming problem which is efficiently solvable

DOI10.1016/0196-6774(88)90008-9zbMath0649.90077OpenAlexW2086184989MaRDI QIDQ3795485

Charles E. Leiserson, James B. Saxe

Publication date: 1988

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(88)90008-9

zbMATH Keywords

mixed-integer linear programmingDijkstra's algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11)

Related Items (5)

A generic algorithm for one-dimensional homotopic compaction ⋮ Retiming synchronous circuitry ⋮ A framework for 1-D compaction with forbidden region avoidance ⋮ Shortest path computations in source-deplanarized graphs ⋮ Inequality-sum: a global constraint capturing the objective function

This page was built for publication: A mixed-integer linear programming problem which is efficiently solvable