The invisible‐hand heuristic for origin‐destination integer multicommodity network flows
From MaRDI portal
Publication:6065841
DOI10.1002/net.22026arXiv2007.06693OpenAlexW3130081794MaRDI QIDQ6065841
Unnamed Author, Richard S. Barr
Publication date: 11 December 2023
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.06693
Programming involving graphs or networks (90C35) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Queueing delay guarantees in bandwidth packing
- Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures
- The multi-hour bandwidth packing problem
- Branch and Price for WDM Optical Networks with No Bifurcation of Flow
- Optimization by GRASP
- Some Recent Advances in Network Flows
- Multicommodity network flows—A survey
- Bandwidth Packing: A Tabu Search Approach
- An Integer Programming Approach to the Bandwidth Packing Problem
- A penalized best‐response algorithm for nonlinear single‐path routing problems
- A Lagrangian heuristic algorithm for the time‐dependent combined network design and routing problem
- A branch‐and‐price algorithm for the single‐path virtual network embedding problem
- A GRASP with path-relinking for private virtual circuit routing
- Network Flow Algorithms
- Handbook of metaheuristics
- A new modeling approach for the biobjective exact optimization of satellite payload configuration
This page was built for publication: The invisible‐hand heuristic for origin‐destination integer multicommodity network flows