swMATH20508MaRDI QIDQ32326FDOQ32326
Author name not available (Why is that?)
Official website: https://rd.springer.com/chapter/10.1007%2F978-1-4615-1507-4_27
Cited In (42)
- Restrict-And-Fix
- A POPMUSIC matheuristic for the capacitated vehicle routing problem
- POPMUSIC for the travelling salesman problem
- A hybrid algorithm for the DNA sequencing problem
- Generalized relax-and-fix heuristic
- POPMUSIC as a matheuristic for the berth allocation problem
- VRPSolver
- A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem
- POMO
- A dynamic programming-based matheuristic for the dynamic berth allocation problem
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Two decomposition algorithms for solving a minimum weight maximum clique model for the air conflict resolution problem
- A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem
- Cvrplib
- Two-level decomposition-based matheuristic for airline crew rostering problems with fair working time
- CPU Benchmarks
- An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
- Decomposition based hybrid metaheuristics
- A survey of the standard location-routing problem
- A hybrid genetic algorithm with decomposition phases for the unequal area facility layout problem
- A metaheuristic algorithm based on chemotherapy science: CSA
- Metaheuristic approaches for the berth allocation problem
- JOBSHOP
- METSlib
- Chunking and cooperation in particle swarm optimization for feature selection
- Metaheuristics for Hard Optimization
- CVRPSEP
- AntNet
- SearchCol
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
- GTSP-LIB
- PySwarms
- MCPSO
- A Lagrangean decomposition for the maximum independent set problem applied to map labeling
- A clustering search metaheuristic for the point-feature cartographic label placement problem
- ALNS
- LKH3
- Heuristic methods for large centroid clustering problems
- Designing granular solution methods for routing problems with time windows
- A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations
- Few statistical tests for proportions comparison
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
This page was built for software: POPMUSIC
