Towards merging binary integer programming techniques with genetic algorithms
From MaRDI portal
Publication:1748518
DOI10.1155/2017/7048042zbMath1387.90147OpenAlexW2766137430MaRDI QIDQ1748518
Publication date: 11 May 2018
Published in: Advances in Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2017/7048042
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem
- A note on ``Event-based MILP models for resource-constrained project scheduling problems
- LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search
- A population-based approach to the resource-constrained project scheduling problem
- Event-based MILP models for resource-constrained project scheduling problems
- A neurogenetic approach for the resource-constrained project scheduling problem
- Experimental investigation of heuristics for resource-constrained project scheduling: an update
- A mathematical model for the multi-mode resource-constrained project scheduling problem with mode dependent time lags
- A random key based genetic algorithm for the resource constrained project scheduling problem
- A real coded genetic algorithm for solving integer and mixed integer optimization problems
- An iterative scheduling technique for resource-constrained project scheduling
- Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
- PSPLIB -- a project scheduling problem library
- A branch and bound algorithm for the resource-constrained project scheduling problem
- Insertion techniques for static and dynamic resource-constrained project scheduling.
- A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version.
- Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
- A linear programming and constraint propagation-based lower bound for the RCPSP
- Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
- A mixed-coding scheme of evolutionary algorithms to solve mixed-integer nonlinear programming problems
- Justification and RCPSP: a technique that pays
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- Bidirectional planning: Improving priority rule-based heuristics for scheduling resource-constrained projects
- Tight LP bounds for resource constrained project scheduling
- An efficient time-windowing procedure for scheduling projects under multiple resource constraints
- A competitive magnet-based genetic algorithm for solving the resource-constrained project scheduling problem
- The project scheduling polyhedron: Dimension, facets and lifting theorems
- A hybrid genetic algorithm for the resource-constrained project scheduling problem
- A hybrid scatter search/electromagnetism meta-heuristic for project scheduling
- An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
- Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem
- A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem
- An evolutionary implicit enumeration procedure for solving the resource‐constrained project scheduling problem
- A self-adapting genetic algorithm for project scheduling under resource constraints
- A competitive heuristic solution technique for resource-constrained project scheduling
This page was built for publication: Towards merging binary integer programming techniques with genetic algorithms