Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization
From MaRDI portal
Publication:2950518
DOI10.1007/978-3-540-78295-7_2zbMath1415.90054OpenAlexW2148150086MaRDI QIDQ2950518
Günther R. Raidl, Jakob Puchinger
Publication date: 9 October 2015
Published in: Hybrid Metaheuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78295-7_2
Convex programming (90C25) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (15)
Decomposition based hybrid metaheuristics ⋮ Matheuristics: survey and synthesis ⋮ A recombination‐based matheuristic for mixed integer programming problems with binary variables ⋮ Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints ⋮ Approximation algorithm for squared metric facility location problem with nonuniform capacities ⋮ Mathematical model applied to single-track line scheduling problem in Brazilian railways ⋮ A variable neighborhood search based matheuristic for nurse rostering problems ⋮ Staff assignment with lexicographically ordered acceptance levels ⋮ A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic ⋮ A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems ⋮ Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds ⋮ Heuristics for a flowshop scheduling problem with stepwise job objective function ⋮ Improving Benders decomposition using a genetic algorithm ⋮ A relax‐and‐price heuristic for the inventory‐location‐routing problem ⋮ A novel dynamic generalized opposition-based grey wolf optimization algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of very large-scale neighborhood search techniques
- About Lagrangian methods in integer optimization
- Special issue: Hybrid metaheuristics. Selected papers based on the presentations at the 1st international workshop (HM 2004), Valencia, Spain, August 2004.
- Hybrid metaheuristics. Second international workshop, HM 2005, Barcelona, Spain, August 29--30, 2005. Proceedings
- Hybrid metaheuristics. Third international workshop, HM 2006, Gran Canaria, Spain, October 13--15, 2006. Proceedings
- Bringing order into the neighborhoods: Relaxation guided variable neighborhood search
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
- On the solution of traveling salesman problems
- A genetic algorithm for the multidimensional knapsack problem
- An expanding-core algorithm for the exact \(0-1\) knapsack problem
- Embedding branch and bound within evolutionary algorithms
- Local branching
- The volume algorithm: Producing primal solutions with a subgradient method
- A greedy genetic algorithm for the quadratic assignment problem
- Separating capacity constraints in the CVRP using tabu search
- The core concept for the Multidimensional Knapsack problem
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Improved results on the 0--1 multidimensional knapsack problem
- A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem
- Variable neighborhood search and local branching
- Parametric tabu-search for mixed integer programs
- A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
- A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
- The feasibility pump
- Models and algorithms for three-stage two-dimensional bin packing
- A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem
- An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
- A Hybrid Genetic/Optimization Algorithm for Finite-Horizon, Partially Observed Markov Decision Processes
- An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions
- Accelerating Benders Decomposition by Local Branching
- A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem
- A Linear Programming Approach to the Cutting-Stock Problem
- A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem
- An Algorithm for Large Zero-One Knapsack Problems
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- Optimized Crossover for the Independent Set Problem
- A hybrid search combining interior point methods and metaheuristics for 0-1 programming
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- Selected Topics in Column Generation
- Branch-and-Bound Methods: A Survey
- Surrogate Constraints
- Evolutionary Computation in Combinatorial Optimization
- Genetic Programming
- Adaptive memory programming: a unified view of metaheuristics
- Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems
This page was built for publication: Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization
