On the Effectiveness of the Linear Programming Relaxation of the 0-1 Multi-commodity Minimum Cost Network Flow Problem
暂无分享,去创建一个
[1] Margarida Moz,et al. An Integer Multicommodity Flow Model Applied to the Rerostering of Nurse Schedules , 2003, Ann. Oper. Res..
[2] Giorgio Gallo,et al. A Multicommodity Flow Approach to the Crew Rostering Problem , 2004, Oper. Res..
[3] Ulrik Brandes,et al. A Software Package of Algorithms and Heuristics for Disjoint Paths in Planar Networks , 1999, Discret. Appl. Math..
[4] James R. Evans. Technical Note - A Single-Commodity Transformation for Certain Multicommodity Networks , 1978, Oper. Res..
[5] R. Kraut,et al. Vehicle scheduling in public transit and Lagrangean pricing , 1998 .
[6] F. Spieksma,et al. A branch‐and‐price algorithm for a hierarchical crew scheduling problem , 2002 .
[7] Warren B. Powell,et al. A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem , 1993, Oper. Res..
[8] Yann Vaxès,et al. Multicommodity network flow with jump constraints , 1997, Discret. Math..
[9] A. Ozdaglar,et al. Optimal Solution of Integer Multicommodity Flow Problems With Application in Optical Networks , 2004 .
[10] Jacques Desrosiers,et al. Daily Aircraft Routing and Scheduling , 1994 .
[11] Andrew B. Whinston,et al. A matching theorem for graphs , 1970 .
[12] L. Gouveia. Multicommodity flow models for spanning trees with hop constraints , 1996 .