LocalSolver 1.x: A black-box local-search solver for 0-1 programming
From MaRDI portal
Publication:657572
DOI10.1007/s10288-011-0165-9zbMath1231.90318OpenAlexW1965513150MaRDI QIDQ657572
Frédéric Gardi, Karim Nouioua, Romain Megel, Bertrand Estellon, Thierry Benoist
Publication date: 10 January 2012
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-011-0165-9
Applications of mathematical programming (90C90) Integer programming (90C10) Combinatorial optimization (90C27) Case-oriented studies in operations research (90B90) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items
ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms, MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration, A constraint-based local search backend for MiniZinc, A three-phase matheuristic algorithm for the multi-day task assignment problem, Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs, A 0-1 integer linear programming approach to schedule outages of nuclear power plants, Computing feasible points for binary MINLPs with MPECs, Empirical decision model learning, HMS: a hybrid multi-start algorithm for solving binary linear programs, LocalSolver, Large-scale parallelism for constraint-based local search: the costas array case study, Using VRPSolver to efficiently solve the \textsc{differential harvest problem}
Uses Software
Cites Work
- Two local search approaches for solving real-life car sequencing problems
- An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
- Minimum formwork stock problem on residential buildings construction sites
- Localizer
- Parallel Local Search in Comet
- Large neighborhood improvements for solving car sequencing problems
- Scheduling Social Golfers Locally
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Principles and Practice of Constraint Programming – CP 2004
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
- Unnamed Item
- Unnamed Item