A method to improve integer linear programming problem with branch-and-bound procedure

DOI10.1016/j.amc.2005.11.171zbMath1102.65066OpenAlexW2006797166MaRDI QIDQ849748

Cheng-Yuan Ku, Ming-Chai Li, Din Yuen Chan

Publication date: 31 October 2006

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2005.11.171

zbMATH Keywords

numerical examplesdualityoperations researchacceleration of computation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05)

Cites Work

• Evolution and state-of-the-art in integer programming
• A phase-1 approach for the generalized simplex algorithm
• Solution of Integer Linear Programming Problems by Direct Search
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A method to improve integer linear programming problem with branch-and-bound procedure