Pages that link to "Item:Q697563"

The following pages link to A survey of very large-scale neighborhood search techniques (Q697563):

Displaying 50 items.

• A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning (Q1042176) (← links)
• Hybridizing exact methods and metaheuristics: a taxonomy (Q1042187) (← links)
• Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables (Q1628128) (← links)
• An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem (Q1652047) (← links)
• A large neighborhood search heuristic for supply chain network design (Q1652183) (← links)
• Clustered maximum weight clique problem: algorithms and empirical analysis (Q1652358) (← links)
• Large neighborhood search applied to the software module clustering problem (Q1652543) (← links)
• The quadratic minimum spanning tree problem and its variations (Q1662110) (← links)
• Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs (Q1695015) (← links)
• A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem (Q1695027) (← links)
• Heuristics for vehicle routing problems: sequence or set optimization? (Q1722969) (← links)
• Solving the traveling salesman problem with interdiction and fortification (Q1728213) (← links)
• A tolerance function for the multiobjective set covering problem (Q1733317) (← links)
• Markov chain methods for the bipartite Boolean quadratic programming problem (Q1753461) (← links)
• An efficient matheuristic for offline patient-to-bed assignment problems (Q1754343) (← links)
• Hybrid adaptive large neighborhood search for the optimal statistic median problem (Q1761216) (← links)
• An improved LNS algorithm for real-time vehicle routing problem with time windows (Q1761960) (← links)
• Large neighbourhood search algorithms for the founder sequence reconstruction problem (Q1761968) (← links)
• Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem (Q1762096) (← links)
• Data-independent neighborhood functions and strict local optima (Q1763477) (← links)
• Extended neighborhood: Definition and characterization (Q1764249) (← links)
• Minimizing energies with hierarchical costs (Q1931618) (← links)
• A survey of neighborhood construction algorithms for clustering and classifying data points (Q2065978) (← links)
• Finding the maximum multi improvement on neighborhood exploration (Q2070118) (← links)
• A general variable neighborhood search for the cyclic antibandwidth problem (Q2114825) (← links)
• Short-term scheduling of production fleets in underground mines using CP-based LNS (Q2117237) (← links)
• Performance guarantees of local search for minsum scheduling problems (Q2118098) (← links)
• The min-p robust optimization approach for facility location problem under uncertainty (Q2165274) (← links)
• Algorithms for the minmax regret path problem with interval data (Q2198244) (← links)
• Comprehensive optimization of urban rail transit timetable by minimizing total travel times under time-dependent passenger demand and congested conditions (Q2295338) (← links)
• A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts (Q2307262) (← links)
• Introduction to reconfiguration (Q2331456) (← links)
• The influence of problem specific neighborhood structures in metaheuristics performance (Q2337103) (← links)
• Four-point conditions for the TSP: the complete complexity classification (Q2339841) (← links)
• Explanation-based large neighborhood search (Q2342597) (← links)
• Combining very large scale and ILP based neighborhoods for a two-level location problem (Q2356178) (← links)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• A heuristic framework on a common generalization of the vehicle routing problem and the linear ordering problem (Q2358180) (← links)
• Variable and large neighborhood search to solve the multiobjective set covering problem (Q2359157) (← links)
• New convergent heuristics for 0-1 mixed integer programming (Q2378374) (← links)
• A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem (Q2386217) (← links)
• Adaptive large neighborhood search for the curriculum-based course timetabling problem (Q2398424) (← links)
• An exponential (matching based) neighborhood for the vehicle routing problem (Q2427439) (← links)
• A variable neighborhood decomposition search method for supply chain management planning problems (Q2433455) (← links)
• Minimizing makespan on an \(m\)-machine re-entrant flowshop (Q2459401) (← links)
• Exponential neighborhood search for a parallel machine scheduling problem (Q2459402) (← links)
• Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling (Q2460072) (← links)
• An analysis of neighborhood functions on generic solution spaces (Q2462147) (← links)
• Tariff concessions in production sourcing (Q2463506) (← links)
• Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints (Q2480060) (← links)