Models for the piecewise linear unsplittable multicommodity flow problems
DOI10.1016/J.EJOR.2017.01.051zbMATH Open1403.90220OpenAlexW2585959123MaRDI QIDQ1753554FDOQ1753554
Authors: Bernard Fortz, Luis Gouveia, Martim Joyce-Moniz 
Publication date: 29 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01665610/file/PUMF.pdf
Recommendations
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Mixed integer programming (90C11) Communication networks in operations research (90B18)
Cites Work
- Title not available (Why is that?)
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- A bundle-type algorithm for routing in telecommunication data networks
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- Title not available (Why is that?)
- Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
- Title not available (Why is that?)
- A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
- An Integer Programming Approach to the Bandwidth Packing Problem
- A delay dependent queue discipline
- A hybrid column generation with GRASP and path relinking for the network load balancing problem
- Increasing internet capacity using local search
- Unsplittable non-additive capacitated network design using set functions polyhedra
- A composite algorithm for a concave-cost network flow problem
- On the minimum cost multiple-source unsplittable flow problem
- Solving the capacitated local access network design problem
- A Lagrangian heuristic algorithm for the time‐dependent combined network design and routing problem
- Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol
Cited In (7)
- Dynamic unsplittable flows with path-change penalties: new formulations and solution schemes for large instances
- On the minimum cost multiple-source unsplittable flow problem
- Adaptive generalized Nash equilibrium seeking algorithm for nonsmooth aggregative game under dynamic event-triggered mechanism
- Title not available (Why is that?)
- Heterogeneous flow distribution at the peak load in the multiuser network
- Distributed generalized Nash equilibrium seeking algorithm for nonsmooth aggregative games
- Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
Uses Software
This page was built for publication: Models for the piecewise linear unsplittable multicommodity flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753554)
