A new method of integer linear programming - branch direction search method

DOI10.1007/BF01895525MaRDI QIDQ1067999zbMATH OpenOpenAlexFDO

Authors Delin Xia

Publication date 1985

Published in Applied Mathematics and Mechanics. (English Edition) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01895525

zbMATH Keywords

robustnessinteger linear programmingengineering designfast convergence

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Applications of mathematical programming (90C90) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 5926438
• An algorithm of internal feasible directions for linear integer programming
• An Isometric Surface Method For Integer Linear Programming * *Supported by the R&D base on advanced manufacturing technology, Academia Sinica
• A new procedure for solving integer linear programming problems
• A new implicit enumerative search for the solution to an integer linear program

Cited in

(5)

• A new procedure for solving integer linear programming problems
• An Isometric Surface Method For Integer Linear Programming * *Supported by the R&D base on advanced manufacturing technology, Academia Sinica
• A method to improve integer linear programming problem with branch-and-bound procedure
• A discrete nonlinear stepping optimization method and its application
• scientific article; zbMATH DE number 1450261 (Why is no real title available?)

This page was built for publication: A new method of integer linear programming - branch direction search method

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