Efficient Heuristic Procedures for Integer Linear Programming with an Interior
From MaRDI portal
Cited in
(42)- Feasibility pump 2.0
- Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
- An interior point algorithm to solve computationally difficult set covering problems
- Zero-one programming with many variables and few constraints
- Cutting-plane theory: Algebraic methods
- 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
- A computational study of an objective hyperplane search heuristic for the general integer linear programming problem
- The multidimensional 0-1 knapsack problem: an overview.
- New techniques for linear arithmetic: cubes and equalities
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Heuristic methods and applications: A categorized survey
- Parametric formulation of the general integer linear programming problem
- Generalized relax-and-fix heuristic
- A feasible rounding approach for mixed-integer optimization problems
- Feasibility Pump-like heuristics for mixed integer problems
- Repairing MIP infeasibility through local branching
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- The feasibility pump
- Fast cube tests for LIA constraint solving
- Hill Climbing with Multiple Local Optima
- Heuristische Lösungsverfahren Versuch einer Begriffsklärung
- Experimental results on Hillier's linear search
- Heuristische Verfahren zur Lösung allgemeiner ganzzahliger linearer Optimierungsprobleme (Ein überblick)
- A hybrid approach to discrete mathematical programming
- A computational study of a genetic algorithm to solve the set covering problem
- Low order polynomial bounds on the expected performance of local improvement algorithms
- Boosting the feasibility pump
- Benchmark data set with service programs to approximately solve the set covering problem
- On the number of iterations of local improvement algorithms
- A framework for constructing general integer problems with well-determined duality gaps
- Matheuristics: survey and synthesis
- An interior point cutting plane heuristic for mixed integer programming
- A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack
- A computational study of parametric tabu search for 0-1 mixed integer programs
- A heuristic algorithm for the multidimensional zero-one knapsack problem
- Large-scale mixed integer programming: Benders-type heuristics
- Interior-point algorithms for global optimization
- An algorithm of internal feasible directions for linear integer programming
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- A path relinking approach for the team orienteering problem
This page was built for publication: Efficient Heuristic Procedures for Integer Linear Programming with an Interior
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5568934)
