LocalSolver 1.x: A black-box local-search solver for 0-1 programming
From MaRDI portal
(Redirected from Publication:657572)
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
Cites work
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
- An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
- scientific article; zbMATH DE number 1016966 (Why is no real title available?)
- scientific article; zbMATH DE number 2084750 (Why is no real title available?)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Large neighborhood improvements for solving car sequencing problems
- Localizer
- Minimum formwork stock problem on residential buildings construction sites
- Parallel Local Search in Comet
- Principles and Practice of Constraint Programming – CP 2004
- Scheduling Social Golfers Locally
- Two local search approaches for solving real-life car sequencing problems
Cited in
(23)- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
- Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
- LocalSolver
- Computing feasible points for binary MINLPs with MPECs
- HMS: a hybrid multi-start algorithm for solving binary linear programs
- Localizer
- Using VRPSolver to efficiently solve the \textsc{differential harvest problem}
- Large-scale parallelism for constraint-based local search: the costas array case study
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
- A 0-1 integer linear programming approach to schedule outages of nuclear power plants
- scientific article; zbMATH DE number 1406244 (Why is no real title available?)
- Empirical decision model learning
- A three-phase matheuristic algorithm for the multi-day task assignment problem
- Learning driven three-phase search for the maximum independent union of cliques problem
- A Huff-like location model with quality adjustment and/or closing of existing facilities
- Economic production quantity (EPQ) model in `pull' managed single-machine multi-item production systems
- Fifty years of research in scheduling -- theory and applications
- Invariant graph propagation in constraint-based local search
- Local-MIP: efficient local search for mixed integer programming
- Two-phase GRASP for the multi-constraint graph partitioning problem
- \textsc{Athanor}: local search over abstract constraint specifications
- Title not available (Why is no real title available?)
- A constraint-based local search backend for MiniZinc
Describes a project that uses
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)
