Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
From MaRDI portal
Recommendations
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Decomposition based hybrid metaheuristics
- Special issue on: `matheuristics`
- Hybrid metaheuristics: an introduction
Cites work
- A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem
- A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem
- A genetic algorithm for the multidimensional knapsack problem
- A greedy genetic algorithm for the quadratic assignment problem
- A hybrid genetic/optimization algorithm for finite-horizon, partially observed Markov decision processes
- A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
- A hybrid search combining interior point methods and metaheuristics for 0-1 programming
- A hybrid tabu search/branch-and-bound algorithm for the direct flight network design problem
- A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem
- A Linear Programming Approach to the Cutting-Stock Problem
- A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem
- A survey of very large-scale neighborhood search techniques
- About Lagrangian methods in integer optimization
- Accelerating Benders decomposition by local branching
- Adaptive memory programming: a unified view of metaheuristics
- An Algorithm for Large Zero-One Knapsack Problems
- An evolutionary algorithm for polishing mixed integer programming solutions
- An expanding-core algorithm for the exact 0-1 knapsack problem
- An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
- Branch-and-Bound Methods: A Survey
- 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
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- Embedding branch and bound within evolutionary algorithms
- Evolutionary Computation in Combinatorial Optimization
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Fundamentals of scatter search and path relinking
- Genetic Programming
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 1961991 (Why is no real title available?)
- scientific article; zbMATH DE number 1488101 (Why is no real title available?)
- scientific article; zbMATH DE number 2159465 (Why is no real title available?)
- scientific article; zbMATH DE number 2090690 (Why is no real title available?)
- scientific article; zbMATH DE number 2209656 (Why is no real title available?)
- scientific article; zbMATH DE number 2209665 (Why is no real title available?)
- 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
- Improved results on the 0--1 multidimensional knapsack problem
- Local branching
- Models and algorithms for three-stage two-dimensional bin packing
- On the solution of traveling salesman problems
- Optimized Crossover for the Independent Set Problem
- Parametric tabu-search for mixed integer programs
- Selected Topics in Column Generation
- Separating capacity constraints in the CVRP using tabu search
- Special issue: Hybrid metaheuristics. Selected papers based on the presentations at the 1st international workshop (HM 2004), Valencia, Spain, August 2004.
- Surrogate Constraints
- The core concept for the Multidimensional Knapsack problem
- The feasibility pump
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The volume algorithm: Producing primal solutions with a subgradient method
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems
- Variable neighborhood search and local branching
Cited in
(25)- A meta-control algorithm for generating approximate solutions to binary integer programming problems
- Improving Benders decomposition using a genetic algorithm
- Hybridizing exact methods and metaheuristics: a taxonomy
- Staff assignment with lexicographically ordered acceptance levels
- 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
- A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic
- A novel dynamic generalized opposition-based grey wolf optimization algorithm
- Approximation algorithm for squared metric facility location problem with nonuniform capacities
- Special issue on: `matheuristics`
- Decomposition based hybrid metaheuristics
- Inequalities and Target Objectives for Metaheuristic Search – Part I: Mixed Binary Optimization
- scientific article; zbMATH DE number 1961991 (Why is no real title available?)
- A hybrid search combining interior point methods and metaheuristics for 0-1 programming
- A variable neighborhood search based matheuristic for nurse rostering problems
- A relax-and-price heuristic for the inventory-location-routing problem
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- 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
- A fix-and-optimize heuristic for the unrelated parallel machine scheduling problem
- A matheuristic with re-lot-sizing strategies for flexible job-shop rescheduling problem with lot-streaming and machine reconfigurations
- Mathematical model applied to single-track line scheduling problem in Brazilian railways
This page was built for publication: Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2950518)
