About

Log in?

DTU users get better search results including licensed content and discounts on order fees.

Anyone can log in and get personalized features such as favorites, tags and feeds.

Log in as DTU user Log in as non-DTU user No thanks

DTU Findit

Interpreted as:

title:(Two- AND and AND Three-index AND formulations AND of AND the AND Minimum AND Cost AND Multicommodity AND k-splittable AND Flow AND Problem)

Suggestions: Include records that partially match the query

Filter results
Access
Type
Language
Year
From DTU
Advanced
1 Journal article

Two- and three-index formulations of the minimum cost multicommodity k-splittable flow problem

on Algorithms, 2002, 101–113] introduced the maximum flow multicommodity k-splittable flow problem (MCkFP) where each commodity may use at most k paths between its origin and its destination. This paper studies the -hard minimum cost multicommodity k-splittable flow problem (MCMCkFP) in which a given flow

Year: 2010

Language: English

gmnkj plda echfi ob
2 Conference paper

Two- and Three-index formulations of the Minimum Cost Multicommodity k-splittable Flow Problem

Gamst, Mette; Jensen, Peter Neergaard; Pisinger, David; Plum, Christian Edinger Munk

International Network Optimization Conference — 2009

Year: 2009

Language: English

cihbpajklm fe ogdn

DTU users get better search results including licensed content and discounts on order fees.

Log in as DTU user