Interior Path Methods for Heuristic Integer Programming Procedures

DOI10.1287/OPRE.27.6.1069MaRDI QIDQ3885520zbMATH OpenOpenAlexFDO

Authors Bruce Faaland, Frederick S. Hillier

Publication date 1979

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.27.6.1069

zbMATH Keywords

computational experiencegeneral mixed integer linear programmingheuristic proceduresinequality constraintsinterior path methodspiecewise linear paths

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Mixed integer programming (90C11)

Cited in

(9)

• An interior point algorithm to solve computationally difficult set covering problems
• The multidimensional 0-1 knapsack problem: an overview.
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Heuristic methods and applications: A categorized survey
• Zur kepplimg eines exakten verfahrens mit einem heuristiscieb verfahren für die lösung ganzzahliger linearer optimierungsprobleme
• Boosting the feasibility pump
• Matheuristics: survey and synthesis
• A computational study of parametric tabu search for 0-1 mixed integer programs
• An algorithm of internal feasible directions for linear integer programming

This page was built for publication: Interior Path Methods for Heuristic Integer Programming Procedures

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