scientific article; zbMATH DE number 1874147

MaRDI QIDQ4795660zbMATH OpenFDO

Authors Wei Guo, Yugeng Xi

Publication date 21 October 2003

zbMATH Keywords

local searchbranch and cutbottleneck problemmultiple choice integer program

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Search theory (90B40) Integer programming (90C10)

Recommendations

• The multiple bottleneck transportation problem
• The multiobjective bottleneck transportation problem.
• Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program
• On a bottleneck routing problem
• On ranking of feasible solutions of a bottleneck linear programming problem

Cited in

(1)

• A dynamic programming algorithm on higher-dimensional 0-1 bottleneck problems

This page was built for publication:

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