Pages that link to "Item:Q5568934"
From MaRDI portal
The following pages link to Efficient Heuristic Procedures for Integer Linear Programming with an Interior (Q5568934):
Displayed 41 items.
- Boosting the feasibility pump (Q495939) (← links)
- On the number of iterations of local improvement algorithms (Q594546) (← links)
- An interior point cutting plane heuristic for mixed integer programming (Q632679) (← links)
- A computational study of parametric tabu search for 0-1 mixed integer programs (Q709185) (← links)
- A heuristic algorithm for the multidimensional zero-one knapsack problem (Q789318) (← links)
- Large-scale mixed integer programming: Benders-type heuristics (Q789322) (← links)
- Interior-point algorithms for global optimization (Q804475) (← links)
- An algorithm of internal feasible directions for linear integer programming (Q809890) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- A path relinking approach for the team orienteering problem (Q975993) (← links)
- Feasibility pump 2.0 (Q1043854) (← links)
- Heuristics and reduction methods for multiple constraints 0-1 linear programming problems (Q1067997) (← links)
- An interior point algorithm to solve computationally difficult set covering problems (Q1181917) (← links)
- Zero-one programming with many variables and few constraints (Q1247918) (← links)
- Cutting-plane theory: Algebraic methods (Q1257827) (← links)
- An empirical study of a new metaheuristic for the traveling salesman problem (Q1291637) (← links)
- An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem (Q1291694) (← links)
- A computational study of an objective hyperplane search heuristic for the general integer linear programming problem (Q1368436) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- New techniques for linear arithmetic: cubes and equalities (Q1688532) (← links)
- Exploring relaxation induced neighborhoods to improve MIP solutions (Q1769074) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- Parametric formulation of the general integer linear programming problem (Q1919968) (← links)
- Generalized relax-and-fix heuristic (Q2108128) (← links)
- A feasible rounding approach for mixed-integer optimization problems (Q2419508) (← links)
- Feasibility Pump-like heuristics for mixed integer problems (Q2448898) (← links)
- Repairing MIP infeasibility through local branching (Q2459381) (← links)
- A feasibility pump heuristic for general mixed-integer problems (Q2471275) (← links)
- Improving the feasibility pump (Q2471276) (← links)
- The feasibility pump (Q2571001) (← links)
- Fast Cube Tests for LIA Constraint Solving (Q2817914) (← links)
- Hill Climbing with Multiple Local Optima (Q3690218) (← links)
- Heuristische Lösungsverfahren Versuch einer Begriffsklärung (Q4070995) (← links)
- Experimental results on Hillier's linear search (Q4074674) (← links)
- Heuristische Verfahren zur Lösung allgemeiner ganzzahliger linearer Optimierungsprobleme (Ein überblick) (Q4121710) (← links)
- A hybrid approach to discrete mathematical programming (Q4170534) (← links)
- A computational study of a genetic algorithm to solve the set covering problem (Q4469109) (← links)
- Low order polynomial bounds on the expected performance of local improvement algorithms (Q4721084) (← links)
- Benchmark data set with service programs to approximately solve the set covering problem (Q5756398) (← links)
- A framework for constructing general integer problems with well-determined duality gaps (Q5955093) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)