Models for the piecewise linear unsplittable multicommodity flow problems
type: Item
instance of: scholarly article
title: Models for the piecewise linear unsplittable multicommodity flow problems
zbMATH Open document ID: 1403.90220
author: Bernard Fortz
author: Luis Gouveia
author: Martim Joyce-Moniz
published in: European Journal of Operational Research
publication date: 2018-05-29T00:00:00Z
full work available at URL: PUMF.pdf
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6875845
zbMATH Keywords: networks
zbMATH Keywords: OR in telecommunications
zbMATH Keywords: unsplittable flows
zbMATH Keywords: integer programming
zbMATH Keywords: combinatorial optimization
describes a project that uses: SearchCol
describes a project that uses: SNDlib
MaRDI profile type: Publication
OpenAlex ID: W2585959123
cites work: On splittable and unsplittable flow capacitated network design arc-set polyhedra.
cites work: A composite algorithm for a concave-cost network flow problem
cites work: On the minimum cost multiple-source unsplittable flow problem
cites work: Unsplittable non-additive capacitated network design using set functions polyhedra
cites work: A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
cites work: Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
cites work: A Lagrangian heuristic algorithm for the time‐dependent combined network design and routing problem
cites work: Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol
cites work: Increasing internet capacity using local search
cites work: Q4142699
cites work: A delay dependent queue discipline
cites work: A bundle-type algorithm for routing in telecommunication data networks
cites work: An Integer Programming Approach to the Bandwidth Packing Problem
cites work: Q4663414
cites work: Solving the capacitated local access network design problem
cites work: A hybrid column generation with GRASP and path relinking for the network load balancing problem
cites work: Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
cites work: Q4054818
DOI: 10.1016/J.EJOR.2017.01.051
description: scientific article; zbMATH DE number 6875845