• English
    • français
  • Help
  •  | 
  • Contact
  •  | 
  • About
  •  | 
  • Login
  • HAL portal
  •  | 
  • Pages Pro
  • EN
  •  / 
  • FR
View Item 
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

On the convex piecewise linear unsplittable ...
  • BibTeX
  • CSV
  • Excel
  • RIS

Document type :
Communication dans un congrès avec actes
DOI :
10.1109/DRCN.2016.7470829
Title :
On the convex piecewise linear unsplittable multicommodity flow problem
Author(s) :
Fortz, Bernard [Auteur]
Graphes et Optimisation Mathématique [Bruxelles] [GOM]
Integrated Optimization with Complex Structure [INOCS]
Gouveia, Luis [Auteur]
Universidade de Lisboa = University of Lisbon = Université de Lisbonne [ULISBOA]
Joyce-Moniz, Martim [Auteur]
Université libre de Bruxelles [ULB]
Conference title :
2016 12th International Conference on the Design of Reliable Communication Networks (DRCN)
City :
Paris
Country :
France
Start date of the conference :
2016-03-15
Publication date :
2016
HAL domain(s) :
Computer Science [cs]/Operations Research [math.OC]
English abstract : [en]
We consider the problem of finding the cheapest routing for a set of commodities over a directed graph, such that: i) each commodity flows through a single path, ii) the routing cost of each arc is given by a convex piecewise ...
Show more >
We consider the problem of finding the cheapest routing for a set of commodities over a directed graph, such that: i) each commodity flows through a single path, ii) the routing cost of each arc is given by a convex piecewise linear function of the load (i.e. the total flow) traversing it. We propose a new mixed-integer programming formulation for this problem. This formulation gives a complete description of the associated polyhedron for the single commodity case, and produces very tight linear programming bounds for the multi-commodity case.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Source :
Harvested from HAL
Files
Thumbnail
  • pumf_short.pdf
  • Open access
  • Access the document
Université de Lille

Mentions légales
Accessibilité : non conforme
Université de Lille © 2017