Publication:2776577
From MaRDI portal
zbMath1017.90132MaRDI QIDQ2776577
Publication date: 8 July 2002
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
Metaheuristic approaches for the Berth Allocation Problem, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints, Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS, Fixed set search applied to the clique partitioning problem, POPMUSIC, POPMUSIC as a matheuristic for the berth allocation problem, Decomposition based hybrid metaheuristics, A hybrid algorithm for the DNA sequencing problem, Two-level decomposition-based matheuristic for airline crew rostering problems with fair working time, Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem, A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem, POPMUSIC for the point feature label placement problem, A metaheuristic algorithm based on chemotherapy science: CSA, Designing granular solution methods for routing problems with time windows, A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations, A survey of the standard location-routing problem, Two decomposition algorithms for solving a minimum weight maximum clique model for the air conflict resolution problem, A hybrid genetic algorithm with decomposition phases for the unequal area facility layout problem, POPMUSIC for the travelling salesman problem, Generalized relax-and-fix heuristic, Chunking and cooperation in particle swarm optimization for feature selection, A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem, A dynamic programming-based matheuristic for the dynamic berth allocation problem, A Lagrangean decomposition for the maximum independent set problem applied to map labeling, Few statistical tests for proportions comparison, A clustering search metaheuristic for the point-feature cartographic label placement problem, A POPMUSIC matheuristic for the capacitated vehicle routing problem
