Diversification strategies in local search for a nonbifurcated network loading problem
From MaRDI portal
Publication:1848356
DOI10.1016/S0377-2217(02)00263-1zbMath1082.90506OpenAlexW1988086169MaRDI QIDQ1848356
Patrick Soriano, Bernard Gendron, Jean-Yves Potvin
Publication date: 20 November 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00263-1
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items
A tabu search heuristic for scheduling the production processes at an oil refinery, Metaheuristics: A Canadian Perspective, Separating tight metric inequalities by bilevel programming, Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem, 0-1 reformulations of the multicommodity capacitated network design problem, An exact approach for the multicommodity network optimization problem with a step cost function
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- The convex hull of two core capacitated network design problems
- A study of diversification strategies for the quadratic assignment problem
- Greedy randomized adaptive search procedures
- A branch-and-cut algorithm for capacitated network design problems
- Diversification strategies in tabu search algorithms for the maximum clique problem
- Probabilistic diversification and intensification in local search for vehicle routing
- On algorithms for finding the k shortest paths in a network
- An annotated bibliography of GRASP-Part II: Applications
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- Backbone Network Design Tools with Economic Tradeoffs
- An efficient implementation of an algorithm for findingK shortest simple paths
- Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Network Design Using Cut Inequalities
- Shortest paths, single origin‐destination network design, and associated polyhedra
- Capacitated Network Design—Polyhedral Structure and Computation
- Tabu search for a network loading problem with multiple facilities
- Adaptive memory programming: a unified view of metaheuristics
