LocalSolver 1.x: A black-box local-search solver for 0-1 programming
DOI10.1007/S10288-011-0165-9zbMATH Open1231.90318OpenAlexW1965513150MaRDI QIDQ657572FDOQ657572
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
Recommendations
- A constraint programming framework for local search methods
- Local Search and Constraint Programming
- A general approach for constraint solving by local search
- Local search and the local structure of NP-complete problems
- Local search with a SAT oracle for combinatorial optimization
- scientific article; zbMATH DE number 2080062
- Local search in problems with nonconvex constraints
Applications of mathematical programming (90C90) Case-oriented studies in operations research (90B90) Combinatorial optimization (90C27) Integer programming (90C10) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Cites Work
- Title not available (Why is that?)
- Localizer
- Title not available (Why is that?)
- An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
- Two local search approaches for solving real-life car sequencing problems
- Principles and Practice of Constraint Programming – CP 2004
- Parallel Local Search in Comet
- Minimum formwork stock problem on residential buildings construction sites
- 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
Cited In (16)
- A Huff-like location model with quality adjustment and/or closing of existing facilities
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
- Using VRPSolver to efficiently solve the \textsc{differential harvest problem}
- Computing feasible points for binary MINLPs with MPECs
- Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
- Economic production quantity (EPQ) model in `pull' managed single-machine multi-item production systems
- A three-phase matheuristic algorithm for the multi-day task assignment problem
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
- A constraint-based local search backend for MiniZinc
- LocalSolver
- HMS: a hybrid multi-start algorithm for solving binary linear programs
- Large-scale parallelism for constraint-based local search: the costas array case study
- Title not available (Why is that?)
- Empirical decision model learning
- Learning driven three-phase search for the maximum independent union of cliques problem
- A 0-1 integer linear programming approach to schedule outages of nuclear power plants
Uses Software
This page was built for publication: LocalSolver 1.x: A black-box local-search solver for 0-1 programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q657572)
