• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - Request a copy

A primal–dual simplex algorithm for bi-objective network flow problems

Eusebio, Augusto; Figueira, José; Ehrgott, Matthias (2009), A primal–dual simplex algorithm for bi-objective network flow problems, 4OR, 7, 3, p. 255-273. http://dx.doi.org/10.1007/s10288-008-0087-3

Type
Article accepté pour publication ou publié
Date
2009
Journal name
4OR
Volume
7
Number
3
Publisher
Springer
Pages
255-273
Publication identifier
http://dx.doi.org/10.1007/s10288-008-0087-3
Metadata
Show full item record
Author(s)
Eusebio, Augusto
Figueira, José
Ehrgott, Matthias
Abstract (EN)
In this paper we develop a primal–dual simplex algorithm for the bi-objective linear minimum cost network flow problem. This algorithm improves the general primal–dual simplex algorithm for multi-objective linear programs by Ehrgott et al. (J Optim Theory Appl 134:483–497, 2007). We illustrate the algorithm with an example and provide numerical results.
Subjects / Keywords
Multi-criteria optimization; Multi-objective linear programming; Network flow problem; Primal–dual simplex algorithm

Related items

Showing items related by title and author.

  • Thumbnail
    Finding non-dominated solutions in bi-objective integer network flow problems 
    Eusebio, Augusto; Figueira, José (2009) Article accepté pour publication ou publié
  • Thumbnail
    On the computation of all supported efficient solutions in multi-objective integer network flow problems 
    Eusebio, Augusto; Figueira, José (2009) Article accepté pour publication ou publié
  • Thumbnail
    Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem 
    Figueira, José; Paquete, Luis; Simoes, Marco; Vanderpooten, Daniel (2013) Article accepté pour publication ou publié
  • Thumbnail
    Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core 
    Mavrotas, George; Figueira, José; Florios, Kostas (2009) Article accepté pour publication ou publié
  • Thumbnail
    An exact method for the bi-objective one-machine problem with maximum lateness and unit family setup cost objectives 
    Artigues, Christian; Jozefowiez, Nicolas; Aloulou, Mohamed Ali (2010) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo