Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder
From MaRDI portal
Publication:2378418
DOI10.1016/j.ejor.2007.06.060zbMath1156.90418OpenAlexW2082554027MaRDI QIDQ2378418
Anton Valentinovich Eremeev, Pavel Borisovsky, Alexandre Dolgui
Publication date: 8 January 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.06.060
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities ⋮ Hybridizations of evolutionary algorithms with large neighborhood search
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
- Exact algorithms for procurement problems under a total quantity discount structure
- The use of dynamic programming in genetic algorithms for permutation problems
- Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
- A tabu search heuristic procedure for the fixed charge transportation problem
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Approximation of the supply scheduling problem
- The concave cost supply problem.
- The minimum shift design problem
- A New Optimization Method for Large Scale Fixed Charge Transportation Problems
- Feature Article—Genetic Algorithms for the Operations Researcher
- Optimized Crossover for the Independent Set Problem
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- Metaheuristics for Hard Optimization
This page was built for publication: Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder
