Models for the piecewise linear unsplittable multicommodity flow problems

DOI10.1016/j.ejor.2017.01.051zbMath1403.90220OpenAlexW2585959123MaRDI QIDQ1753554

Luís Gouveia, Martim Joyce-Moniz, Bernard Fortz

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

zbMATH Keywords

integer programmingcombinatorial optimizationnetworksOR in telecommunicationsunsplittable flows

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Communication networks in operations research (90B18) Deterministic network models in operations research (90B10)

Related Items (3)

Heterogeneous flow distribution at the peak load in the multiuser network ⋮ Distributed generalized Nash equilibrium seeking algorithm for nonsmooth aggregative games ⋮ Dynamic unsplittable flows with path-change penalties: new formulations and solution schemes for large instances

Uses Software

• SNDlib
• SearchCol

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hybrid column generation with GRASP and path relinking for the network load balancing problem
• Unsplittable non-additive capacitated network design using set functions polyhedra
• Increasing internet capacity using local search
• On splittable and unsplittable flow capacitated network design arc-set polyhedra.
• Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol
• A bundle-type algorithm for routing in telecommunication data networks
• Solving the Capacitated Local Access Network Design Problem
• On the minimum cost multiple-source unsplittable flow problem
• Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
• A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
• Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
• A composite algorithm for a concave-cost network flow problem
• An Integer Programming Approach to the Bandwidth Packing Problem
• A Lagrangian heuristic algorithm for the time‐dependent combined network design and routing problem
• A delay dependent queue discipline

This page was built for publication: Models for the piecewise linear unsplittable multicommodity flow problems