Models for the piecewise linear unsplittable multicommodity flow problems

DOI10.1016/J.EJOR.2017.01.051MaRDI QIDQ1753554zbMATHOpenAlexFDO

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

zbMATH Keywords

combinatorial optimizationnetworksinteger programmingOR in telecommunicationsunsplittable flows

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1947385
• The \(k\)-splittable flow problem
• Network optimization with piecewise linear convex costs
• scientific article; zbMATH DE number 2246654
• A combined matheuristic for the piecewise linear multicommodity network flow problem

Cites work

• scientific article; zbMATH DE number 3470175 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 2150800 (Why is no real title available?)
• A Lagrangian heuristic algorithm for the time-dependent combined network design and routing problem
• A bundle-type algorithm for routing in telecommunication data networks
• A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
• A composite algorithm for a concave-cost network flow problem
• A delay dependent queue discipline
• A hybrid column generation with GRASP and path relinking for the network load balancing problem
• An Integer Programming Approach to the Bandwidth Packing Problem
• Increasing internet capacity using local search
• Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
• On splittable and unsplittable flow capacitated network design arc-set polyhedra.
• On the minimum cost multiple-source unsplittable flow problem
• Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol
• Solving the capacitated local access network design problem
• Unsplittable non-additive capacitated network design using set functions polyhedra
• Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs

Cited in

(7)

• Dynamic unsplittable flows with path-change penalties: new formulations and solution schemes for large instances
• scientific article; zbMATH DE number 2246654 (Why is no real title available?)
• Distributed generalized Nash equilibrium seeking algorithm for nonsmooth aggregative games
• Adaptive generalized Nash equilibrium seeking algorithm for nonsmooth aggregative game under dynamic event-triggered mechanism
• On the minimum cost multiple-source unsplittable flow problem
• Heterogeneous flow distribution at the peak load in the multiuser network
• Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs

Describes a project that uses

Uses Software

• SNDlib
• SearchCol

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)