Adaptive memory in multistart heuristics for multicommodity network design
From MaRDI portal
Publication:535395
DOI10.1007/s10732-010-9130-6zbMath1211.90296OpenAlexW2060030554MaRDI QIDQ535395
Daniel Aloise, Celso Carneiro Ribeiro
Publication date: 11 May 2011
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-010-9130-6
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items (3)
Making a state-of-the-art heuristic faster with data mining ⋮ A minimum cost network flow model for the maximum covering and patrol routing problem ⋮ An exact approach for the multicommodity network optimization problem with a step cost function
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- D.C. programming approach for multicommodity network optimization problems with step increasing cost functions
- A survey of very large-scale neighborhood search techniques
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- Intensification and diversification with elite tabu search solutions for the linear ordering problem
- Exact solution of multicommodity network optimization problems with general step cost functions
- Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
- A polyhedral approach to multicommodity survivable network design
- LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions
- On implementing the push-relabel method for the maximum flow problem
- Discrete cost multicommodity network optimization problems and exact solution methods
- Capacity expansion of fiber optic networks with WDM systems: problem formulation and comparative analysis
- Probability distribution of solution time in GRASP: an experimental investigation
- Probabilistic diversification and intensification in local search for vehicle routing
- TTT plots: a perl program to create time-to-target plots
- Optimal solution of the discrete cost multicommodity network design problem
- A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- Multicommodity Distribution System Design by Benders Decomposition
- A Survey of Linear Cost Multicommodity Network Flows
- A More Portable Fortran Random Number Generator
- Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
- A new proximal decomposition algorithm for routing in telecommunication networks
- The flow deviation method: An approach to store‐and‐forward communication network design
- Variable neighborhood search: Principles and applications
- Tabu search for a network loading problem with multiple facilities
This page was built for publication: Adaptive memory in multistart heuristics for multicommodity network design
