Pages that link to "Item:Q697563"
From MaRDI portal
The following pages link to A survey of very large-scale neighborhood search techniques (Q697563):
Displaying 50 items.
- Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem (Q2491319) (← links)
- Creating very large scale neighborhoods out of smaller ones by compounding moves (Q2491337) (← links)
- Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem (Q2491772) (← links)
- A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem (Q2494814) (← links)
- Minimizing shifts for personnel task scheduling problems: a three-phase algorithm (Q2514834) (← links)
- An integrated inventory-routing system for multi-item joint replenishment with limited vehicle capacity (Q2569152) (← links)
- Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← links)
- A new ILP-based refinement heuristic for vehicle routing problems (Q2583137) (← links)
- A survey of variants and extensions of the location-routing problem (Q2629668) (← links)
- Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs (Q2629716) (← links)
- VNS-based heuristic with an exponential neighborhood for the server load balancing problem (Q2631229) (← links)
- Two very large-scale neighborhoods for single machine scheduling (Q2642308) (← links)
- On the theoretical properties of swap multimoves (Q2643800) (← links)
- The stable set problem and the thinness of a graph (Q2643810) (← links)
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs (Q2654395) (← links)
- The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands (Q2664291) (← links)
- A variable depth neighborhood search algorithm for the min-max arc crossing problem (Q2669507) (← links)
- A survey of adaptive large neighborhood search algorithms and applications (Q2676311) (← links)
- Intensification neighborhoods for local search methods (Q2776572) (← links)
- A game theoretic model for the optimal location of integrated air defense system missile batteries (Q2830945) (← links)
- The multiobjective multidimensional knapsack problem: a survey and a new approach (Q2865172) (← links)
- Memory and Learning in Metaheuristics (Q2866122) (← links)
- Column generation based primal heuristics (Q2883638) (← links)
- Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization (Q2950518) (← links)
- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems (Q2950521) (← links)
- A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation (Q3057155) (← links)
- A multi-phase covering Pareto-optimal front method to multi-objective parallel machine scheduling (Q3163193) (← links)
- Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times (Q3163716) (← links)
- Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms (Q3386794) (← links)
- Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines (Q3439462) (← links)
- VLSN search algorithms for partitioning problems using matching neighbourhoods (Q3515505) (← links)
- Large neighborhood improvements for solving car sequencing problems (Q3534210) (← links)
- Very large-scale variable neighborhood search for the generalized assignment problem (Q3604030) (← links)
- Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks (Q4648688) (← links)
- Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem (Q4965126) (← links)
- The Bipartite QUBO (Q5050150) (← links)
- Primal Heuristics for Branch and Price: The Assets of Diving Methods (Q5138257) (← links)
- Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking (Q5139848) (← links)
- Merging Variables: One Technique of Search in Pseudo-Boolean Optimization (Q5214427) (← links)
- Toward unification of exact and heuristic optimization methods (Q5246819) (← links)
- Local search with an exponential neighborhood for the servers load balancing problem (Q5264767) (← links)
- Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time (Q5348455) (← links)
- Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines (Q5443371) (← links)
- Heuristic and metaheuristic methods for computing graph treewidth (Q5479837) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900312) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)
- An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem† (Q6066584) (← links)
- A recombination‐based matheuristic for mixed integer programming problems with binary variables (Q6066716) (← links)
- Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol (Q6104339) (← links)
- Literature reviews in operations research: a new taxonomy and a meta review (Q6106580) (← links)
