POPMUSIC

swMATH20508MaRDI QIDQ32326FDOQ32326

Author name not available (Why is that?)

Described by source

• POPMUSIC for the point feature label placement problem
• POPMUSIC -- partial optimization metaheuristic under special intensification conditions

Cited In (27)

• 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
• Metaheuristic approaches for the Berth Allocation Problem
• POPMUSIC as a matheuristic for the berth allocation problem
• A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem
• 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
• Two-level decomposition-based matheuristic for airline crew rostering problems with fair working time
• 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
• Chunking and cooperation in particle swarm optimization for feature selection
• Metaheuristics for Hard Optimization
• Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
• 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
• 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