The following pages link to (Q2776577):
Displaying 29 items.
- POPMUSIC (Q32326) (← links)
- POPMUSIC as a matheuristic for the berth allocation problem (Q276540) (← links)
- Decomposition based hybrid metaheuristics (Q319285) (← links)
- A hybrid algorithm for the DNA sequencing problem (Q406500) (← links)
- Two-level decomposition-based matheuristic for airline crew rostering problems with fair working time (Q723919) (← links)
- Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem (Q953318) (← links)
- A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem (Q991376) (← links)
- POPMUSIC for the point feature label placement problem (Q1011166) (← links)
- A metaheuristic algorithm based on chemotherapy science: CSA (Q1659258) (← links)
- Designing granular solution methods for routing problems with time windows (Q1694925) (← links)
- A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations (Q1695784) (← links)
- A survey of the standard location-routing problem (Q1698292) (← links)
- Two decomposition algorithms for solving a minimum weight maximum clique model for the air conflict resolution problem (Q1752252) (← links)
- A hybrid genetic algorithm with decomposition phases for the unequal area facility layout problem (Q1752256) (← links)
- POPMUSIC for the travelling salesman problem (Q1991147) (← links)
- Generalized relax-and-fix heuristic (Q2108128) (← links)
- Chunking and cooperation in particle swarm optimization for feature selection (Q2163857) (← links)
- A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem (Q2174909) (← links)
- A dynamic programming-based matheuristic for the dynamic berth allocation problem (Q2178356) (← links)
- A Lagrangean decomposition for the maximum independent set problem applied to map labeling (Q2359523) (← links)
- Few statistical tests for proportions comparison (Q2464220) (← links)
- A clustering search metaheuristic for the point-feature cartographic label placement problem (Q2514783) (← links)
- A POPMUSIC matheuristic for the capacitated vehicle routing problem (Q2669570) (← links)
- Metaheuristic approaches for the Berth Allocation Problem (Q4987695) (← links)
- Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5891242) (← links)
- Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5925164) (← links)
- Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints (Q6088241) (← links)
- Solving the bi‐objective capacitated <i>p</i>‐median problem with multilevel capacities using compromise programming and VNS (Q6088248) (← links)
- Fixed set search applied to the clique partitioning problem (Q6112737) (← links)
