Efficient Heuristic Procedures for Integer Linear Programming with an Interior

DOI10.1287/opre.17.4.600zbMath0176.49902OpenAlexW1982719520MaRDI QIDQ5568934

Frederick S. Hillier

Publication date: 1969

Published in: Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

operations research

Related Items (41)

A computational study of an objective hyperplane search heuristic for the general integer linear programming problem ⋮ On the number of iterations of local improvement algorithms ⋮ Parametric formulation of the general integer linear programming problem ⋮ A feasible rounding approach for mixed-integer optimization problems ⋮ Matheuristics: survey and synthesis ⋮ New techniques for linear arithmetic: cubes and equalities ⋮ An interior point cutting plane heuristic for mixed integer programming ⋮ Heuristische Lösungsverfahren Versuch einer Begriffsklärung ⋮ Experimental results on Hillier's linear search ⋮ The multidimensional 0-1 knapsack problem: an overview. ⋮ Feasibility Pump-like heuristics for mixed integer problems ⋮ An interior point algorithm to solve computationally difficult set covering problems ⋮ Repairing MIP infeasibility through local branching ⋮ Boosting the feasibility pump ⋮ A feasibility pump heuristic for general mixed-integer problems ⋮ Improving the feasibility pump ⋮ Heuristische Verfahren zur Lösung allgemeiner ganzzahliger linearer Optimierungsprobleme (Ein überblick) ⋮ Exploring relaxation induced neighborhoods to improve MIP solutions ⋮ A path relinking approach for the team orienteering problem ⋮ A computational study of parametric tabu search for 0-1 mixed integer programs ⋮ Benchmark data set with service programs to approximately solve the set covering problem ⋮ A framework for constructing general integer problems with well-determined duality gaps ⋮ Zero-one programming with many variables and few constraints ⋮ A hybrid approach to discrete mathematical programming ⋮ Cutting-plane theory: Algebraic methods ⋮ Fast Cube Tests for LIA Constraint Solving ⋮ Low order polynomial bounds on the expected performance of local improvement algorithms ⋮ Heuristic methods and applications: A categorized survey ⋮ A computational study of a genetic algorithm to solve the set covering problem ⋮ An empirical study of a new metaheuristic for the traveling salesman problem ⋮ An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem ⋮ Feasibility pump 2.0 ⋮ The feasibility pump ⋮ A heuristic algorithm for the multidimensional zero-one knapsack problem ⋮ Large-scale mixed integer programming: Benders-type heuristics ⋮ Interior-point algorithms for global optimization ⋮ Generalized relax-and-fix heuristic ⋮ Heuristics and reduction methods for multiple constraints 0-1 linear programming problems ⋮ An algorithm of internal feasible directions for linear integer programming ⋮ Hill Climbing with Multiple Local Optima ⋮ The multidimensional 0-1 knapsack problem -- bounds and computational aspects

This page was built for publication: Efficient Heuristic Procedures for Integer Linear Programming with an Interior