A Mixed Integer Linear Programming Problem Which is Efficiently Solvable

Efficient algorithms are known for the simple linear programming problem where each inequality is of the form xj-xi<=aij. Furthermore, these techniques extend to the integer linear programming variant of the problem. This paper gives an efficient solution to the mixed-integer linear programming v...

Бүрэн тодорхойлолт

Номзүйн дэлгэрэнгүй
Үндсэн зохиолчид: Leiserson, Charles E., Saxe, James B.
Хэвлэсэн: 2023
Онлайн хандалт:https://hdl.handle.net/1721.1/149093