Experimental results on Hillier's linear search

DOI10.1007/BF01681357zbMath0314.90066OpenAlexW2071432758MaRDI QIDQ4074674

T. H. C. Smith, Robert G. Jeroslow

Publication date: 1975

Published in: Mathematical Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Search theory (90B40)

Related Items

An interior point cutting plane heuristic for mixed integer programming, The multidimensional 0-1 knapsack problem: an overview., An interior point algorithm to solve computationally difficult set covering problems, Boosting the feasibility pump, Zero-one programming with many variables and few constraints, Cutting-plane theory: Algebraic methods, Heuristic methods and applications: A categorized survey

Cites Work

• Efficient Heuristic Procedures for Integer Linear Programming with an Interior
• Unnamed Item
• Unnamed Item