Interior Path Methods for Heuristic Integer Programming Procedures
From MaRDI portal
Publication:3885520
DOI10.1287/opre.27.6.1069zbMath0442.90062OpenAlexW2092519139MaRDI QIDQ3885520
Frederick S. Hillier, Bruce Faaland
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
inequality constraintscomputational experiencepiecewise linear pathsheuristic proceduresinterior path methodsgeneral mixed integer linear programming
Numerical mathematical programming methods (65K05) Integer programming (90C10) Mixed integer programming (90C11)
Related Items
Zur kepplimg eines exakten verfahrens mit einem heuristiscieb verfahren für die lösung ganzzahliger linearer optimierungsprobleme, Matheuristics: survey and synthesis, The multidimensional 0-1 knapsack problem: an overview., An interior point algorithm to solve computationally difficult set covering problems, Boosting the feasibility pump, Exploring relaxation induced neighborhoods to improve MIP solutions, A computational study of parametric tabu search for 0-1 mixed integer programs, Heuristic methods and applications: A categorized survey, An algorithm of internal feasible directions for linear integer programming
