LocalSolver
From MaRDI portal
Software:17007
swMATH4850MaRDI QIDQ17007FDOQ17007
Author name not available (Why is that?)
Cited In (16)
- An Efficient Local Search for Partial Latin Square Extension Problem
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
- AN EFFICIENT LOCAL SEARCH FOR THE CONSTRAINED SYMMETRIC LATIN SQUARE CONSTRUCTION PROBLEM
- Generating compound moves in local search by hybridisation with complete search
- 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
- Heuristics for the constrained incremental graph drawing problem
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
- A constraint-based local search backend for MiniZinc
- HMS: a hybrid multi-start algorithm for solving binary linear programs
- Large-scale parallelism for constraint-based local search: the costas array case study
- Empirical decision model learning
- Characterization and Automation of Matching-Based Neighborhoods
- A 0-1 integer linear programming approach to schedule outages of nuclear power plants
- Iterated local search with Trellis-neighborhood for the partial Latin square extension problem
This page was built for software: LocalSolver
