| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 4 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
The all-or-nothing multicommodity flow problem.  |
STOC  |
2004 |
DBLP DOI BibTeX RDF |
all-or-nothing multicommodity flow, approximation algorithms, online algorithms, multicommodity flow, oblivious routing, edge disjoint paths |
| 3 | Aleksander Madry |
Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms.  |
STOC  |
2010 |
DBLP DOI BibTeX RDF |
dynamic graph algorithms, multicommodity flow problems |
| 3 | Luyi Gui, Özlem Ergun |
Dual Payoffs, Core and a Collaboration Mechanism Based on Capacity Exchange Prices in Multicommodity Flow Games.  |
WINE  |
2008 |
DBLP DOI BibTeX RDF |
Multicommodity Flow Game, Dual Payoffs, Exchange Prices, Mechanism Design, Core |
| 3 | Kumar Padmanabh, Rajarshi Roy |
Multicommodity Flow Based Maximum Lifetime Routing in Wireless Sensor Network.  |
ICPADS  |
2006 |
DBLP DOI BibTeX RDF |
Multicommodity Flow Maximum Lifetime routing, Wireless Sensor Network, Routing Protocol |
| 3 | Margarida Moz, Margarida Vaz Pato |
Solving the Problem of Rerostering Nurse Schedules with Hard Constraints: New Multicommodity Flow Models.  |
Annals OR  |
2004 |
DBLP DOI BibTeX RDF |
rerostering, integer multicommodity flow problems, binary linear programming, nurse scheduling |
| 3 | Margarida Moz, Margarida Vaz Pato |
An Integer Multicommodity Flow Model Applied to the Rerostering of Nurse Schedules.  |
Annals OR  |
2003 |
DBLP DOI BibTeX RDF |
employee scheduling, rerostering, integer multicommodity flow problems, integer linear programming |
| 3 | David Coudert, Hervé Rivano, Xavier Roche |
A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem.  |
WAOA  |
2003 |
DBLP DOI BibTeX RDF |
combinatorial approximation, Multicommodity flow, incremental algorithm, dynamic shortest paths |
| 3 | Lisa Fleischer |
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities.  |
FOCS  |
1999 |
DBLP DOI BibTeX RDF |
approximation algorithms, network flow, multicommodity flow |
| 2 | Frank Thomson Leighton, Ankur Moitra |
Extensions and limits to vertex sparsification.  |
STOC  |
2010 |
DBLP DOI BibTeX RDF |
oblivious reductions, multicommodity flow |
| 2 | Frédéric Babonneau, Jean-Philippe Vial |
ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems.  |
Math. Program.  |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) Nondifferentiable optimization, Network flow problem |
| 2 | Elona Erez, Meir Feder |
Improving the multicommodity flow rates with network codes for two sources.  |
IEEE Journal on Selected Areas in Communications  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Pierre Chardaire, Abdel Lisser |
Nonoriented Multicommodity Flow Problems.  |
Encyclopedia of Optimization  |
2009 |
DBLP DOI BibTeX RDF |
Network, Multicommodity flow, Decomposition algorithms |
| 2 | Peng-Jun Wan |
Multiflows in multihop wireless networks.  |
MobiHoc  |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithms, multicommodity flow, capacity region |
| 2 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
A Note on Multiflows and Treewidth.  |
Algorithmica  |
2009 |
DBLP DOI BibTeX RDF |
Product multicommodity flow, Treewidth, Edge-disjoint paths |
| 2 | George Tsaggouris, Christos D. Zaroliagis |
Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-Linear Objectives with Applications.  |
Theory Comput. Syst.  |
2009 |
DBLP DOI BibTeX RDF |
Multiobjective shortes path, Non-linear objectives, Multiple constrained (optimal) path, Non-additive shortest path, Qos-aware multicommodity flow, Multiobjective optimization, FPTAS |
| 2 | George Karakostas |
Faster approximation schemes for fractional multicommodity flow problems.  |
ACM Transactions on Algorithms  |
2008 |
DBLP DOI BibTeX RDF |
Multicommodity flows, fully-polynomial time approximation schemes |
| 2 | Ritesh Madan, Devavrat Shah, Olivier Lévêque |
Product Multicommodity Flow in Wireless Networks.  |
IEEE Transactions on Information Theory  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Jochen Könemann, Ojas Parekh, David Pritchard |
Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees.  |
WAOA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | André Schumacher, Harri Haanpää |
Distributed network utility maximization in wireless networks with a bounded number of paths.  |
PM2HW2N  |
2008 |
DBLP DOI BibTeX RDF |
dual decomposition, congestion control, multipath routing, multicommodity flow, proportional fairness |
| 2 | Baruch Awerbuch, Rohit Khandekar, Satish Rao |
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework.  |
SODA  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar |
Hardness of routing with congestion in directed graphs.  |
STOC  |
2007 |
DBLP DOI BibTeX RDF |
all-or-nothing flow, hardness of approximation, multicommodity flow, edge-disjoint paths, integrality gap, congestion minimization |
| 2 | Julia Chuzhoy, Sanjeev Khanna |
Polynomial flow-cut gaps and hardness of directed cut problems.  |
STOC  |
2007 |
DBLP DOI BibTeX RDF |
concurrent flow, directed multicut, directed sparsest cut, flow-cut gaps, hardness of approximation, multicommodity flow |
| 2 | Chandra Chekuri, Sanjeev Khanna |
Edge-disjoint paths revisited.  |
ACM Transactions on Algorithms  |
2007 |
DBLP DOI BibTeX RDF |
multicommodity flow relaxation, approximation algorithm, greedy algorithm, Edge-disjoint paths |
| 2 | Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd |
Multicommodity demand flow in a tree and packing integer programs.  |
ACM Transactions on Algorithms  |
2007 |
DBLP DOI BibTeX RDF |
Integer multicommodity flow, packing integer program, approximation algorithm, tree, integrality gap |
| 2 | Tom Coenen, Maurits de Graaf, Richard J. Boucherie |
An Upper Bound on Multi-hop Wireless Network Performance.  |
International Teletraffic Congress  |
2007 |
DBLP DOI BibTeX RDF |
cut condition, interference, Wireless multi-hop network, multicommodity flow problem |
| 2 | Toshinori Yamada, Kazuhiro Karasawa |
On Finding a Solution in the Core of a Multicommodity Flow Game on a Spider.  |
APCCAS  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | James Broberg, Zhen Liu, Cathy H. Xia, Li Zhang 0002 |
A multicommodity flow model for distributed stream processing.  |
SIGMETRICS/Performance  |
2006 |
DBLP DOI BibTeX RDF |
distributed algorithms, stream processing, multicommodity flow, potential function |
| 2 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
Edge-disjoint paths in Planar graphs with constant congestion.  |
STOC  |
2006 |
DBLP DOI BibTeX RDF |
Planar graphs, multicommodity flow, edge-disjoint paths |
| 2 | Nicholas J. A. Harvey, Robert D. Kleinberg, April Rasala Lehman |
On the capacity of information networks.  |
IEEE Transactions on Information Theory  |
2006 |
DBLP DOI BibTeX RDF |
infomational dominance, k-pairs communication problems, multiple unicast sessions, capacity, network coding, multicommodity flow, sparsity |
| 2 | Christina Fragouli, Tarik Tabet |
On conditions for constant throughput in wireless networks.  |
TOSN  |
2006 |
DBLP DOI BibTeX RDF |
Foundations of sensor and ad hoc networks, constant throughput, min cut bounds, sensor networks throughput, mobility, wireless networks, mobility model, multicommodity flow |
| 2 | Ángel Marín |
Airport management: taxi planning.  |
Annals OR  |
2006 |
DBLP DOI BibTeX RDF |
Aircraft routing and scheduling, Taxi Planning, Airport management, Binary capacitated multicommodity flow network, Fix and Relax, Branch and Bound |
| 2 | Garima Batra, Naveen Garg, Garima Gupta |
Heuristic Improvements for Computing Maximum Multicommodity Flow and Minimum Multicut.  |
ESA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 2 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
Multicommodity flow, well-linked terminals, and routing problems.  |
STOC  |
2005 |
DBLP DOI BibTeX RDF |
all-or-nothing flow, flow-cut gaps, network routing, multicommodity flow, disjoint paths |
| 2 | Wided Ouaja, Barry Richards |
Hybrid Lagrangian relaxation for bandwidth-constrained routing: knapsack decomposition.  |
SAC  |
2005 |
DBLP DOI BibTeX RDF |
integer multicommodity flow problems, network routing, constraint propagation, lagrangian relaxation |
| 2 | Yuan Xue, Yi Cui, Klara Nahrstedt |
Maximizing Lifetime for Data Aggregation in Wireless Sensor Networks.  |
MONET  |
2005 |
DBLP DOI BibTeX RDF |
sensor network, linear programming, multicommodity flow problem |
| 2 | Krzysztof Walkowiak |
On Application of Ant Algorithms to Non-bifurcated Multicommodity Flow Problem.  |
ICAISC  |
2004 |
DBLP DOI BibTeX RDF |
|
| 2 | Ying Du, Danny Z. Chen, Xiaodong Wu |
Approximation Algorithms for Multicommodity Flow and Normalized Cut Problems: Implementations and Experimental Study.  |
COCOON  |
2004 |
DBLP DOI BibTeX RDF |
|
| 2 | Gábor Rétvári, József Bíró, Tibor Cinkler |
A novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering.  |
ISCC  |
2004 |
DBLP DOI BibTeX RDF |
|
| 2 | Yi Cui, Baochun Li, Klara Nahrstedt |
On achieving optimized capacity utilization in application overlay networks with multiple competing sessions.  |
SPAA  |
2004 |
DBLP DOI BibTeX RDF |
multicast, overlay, multicommodity flow |
| 2 | Hongxia Li, Shuicheng Tian, Yuan Pan, Xiao Zhang, Xiaochen Yu |
Minimum-Cost Optimization in Multicommodity Logistic Chain Network.  |
IWMM/GIAE  |
2004 |
DBLP DOI BibTeX RDF |
Transportation Network Management, Maximal-Flow Algorithm, Minimum-Cost Optimization, Multicommodity Flow, Network Operations |
| 2 | Sergio Beker, Nicolas Puech, Vasilis Friderikos |
A Tabu Search Heuristic for the Offline MPLS Reduced Complexity Layout Design Problem.  |
NETWORKING  |
2004 |
DBLP DOI BibTeX RDF |
Layout Complexity, Tabu Search, Traffic Engineering, MPLS, Multicommodity Flow, LSP, MINLP |
| 2 | Meinolf Sellmann, Norbert Sensen, Larissa Timajev |
Multicommodity Flow Approximation Used for Exact Graph Partitioning.  |
ESA  |
2003 |
DBLP DOI BibTeX RDF |
|
| 2 | Evangelos Markakis, Amin Saberi |
On the core of the multicommodity flow game.  |
ACM Conference on Electronic Commerce  |
2003 |
DBLP DOI BibTeX RDF |
duality, core, cooperative games |
| 2 | Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd |
Multicommodity Demand Flow in a Tree.  |
ICALP  |
2003 |
DBLP DOI BibTeX RDF |
integer multicommodity flow, packing integer program, approximation algorithm, tree, integrality gap |
| 2 | George Karakostas |
Faster approximation schemes for fractional multicommodity flow problems.  |
SODA  |
2002 |
DBLP DOI BibTeX RDF |
|
| 2 | Lisa Fleischer, Martin Skutella |
The Quickest Multicommodity Flow Problem.  |
IPCO  |
2002 |
DBLP BibTeX RDF |
|
| 2 | Andrew V. Goldberg, Jeffrey D. Oldham, Serge A. Plotkin, Clifford Stein |
An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow.  |
IPCO  |
1998 |
DBLP DOI BibTeX RDF |
|
| 2 | S. Muthukrishnan, Torsten Suel |
Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow.  |
RANDOM  |
1998 |
DBLP DOI BibTeX RDF |
|
| 2 | Naveen Garg, Jochen Könemann |
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems.  |
FOCS  |
1998 |
DBLP DOI BibTeX RDF |
|
| 2 | Baruch Awerbuch, Frank Thomson Leighton |
A Simple Local-Control Approximation Algorithm for Multicommodity Flow  |
FOCS  |
1993 |
DBLP DOI BibTeX RDF |
DIMACS generator, local-control approximation algorithm, polynomial time flow algorithms, centralized decision making, distributed network, multicommodity flow |
| 2 | Philip N. Klein, Ajit Agrawal, R. Ravi, Satish Rao |
Approximation through Multicommodity Flow  |
FOCS  |
1990 |
DBLP DOI BibTeX RDF |
minimum deletion, max-flow-min-cut theorem, approximation algorithms, multicommodity flow |
| 2 | Frank Thomson Leighton, Satish Rao |
An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms  |
FOCS  |
1988 |
DBLP DOI BibTeX RDF |
max-flow min-cut theorem, minimum quotient separators, 1/3-2/3 separators, VLSI layout area, approximation algorithms, distributed networks, bifurcators, crossing number, multicommodity flow problems, optimal approximation |
| 1 | Jonathan A. Kelner, Gary L. Miller, Richard Peng |
Faster approximate multicommodity flow using quadratically coupled flows.  |
STOC  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gabrio Caimi, Fabián A. Chudak, Martin Fuchsberger, Marco Laumanns, Rico Zenklusen |
A New Resource-Constrained Multicommodity Flow Model for Conflict-Free Train Routing and Scheduling.  |
Transportation Science  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Krzysztof C. Kiwiel |
An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems.  |
Math. Program.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Maurizio Bruglieri, Paola Cappanera, Alberto Colorni, Maddalena Nonato |
Modeling the Gateway Location Problem for Multicommodity Flow Rerouting.  |
INOC  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dritan Nace, Michal Pióro, Artur Tomaszewski, Mateusz Zotkiewicz |
A polynomial multicommodity flow problem with difficult path generation.  |
ICUMT  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Girish N. Nair |
When is n-pairs information a multicommodity flow?  |
ISIT  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Preetha Thulasiraman, Jiming Chen, Xuemin (Sherman) Shen |
Multipath Routing and Max-Min Fair QoS Provisioning under Interference Constraints in Wireless Multihop Networks.  |
IEEE Trans. Parallel Distrib. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
quality of service, routing, fairness, Interference, multicommodity flow |
| 1 | Aleksander Madry |
Faster Approximation Schemes for Fractional Multicommodity Flow Problems via Dynamic Graph Algorithms  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Hiroshi Hirai |
The maximum multiflow problems with bounded fractionality.  |
STOC  |
2010 |
DBLP DOI BibTeX RDF |
metrics, polynomial time algorithms, multicommodity flows |
| 1 | David J. Aldous, Colin McDiarmid, Alex D. Scott |
Uniform multicommodity flow through the complete graph with random edge-capacities.  |
Oper. Res. Lett.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mehdi Ghatee, S. Mehdi Hashemi |
Some concepts of the fuzzy multicommodity flow problem and their application in fuzzy network design.  |
Mathematical and Computer Modelling  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Braun, Stephan Winter |
Ad Hoc Solution of the Multicommodity-Flow-Over-Time Problem.  |
IEEE Transactions on Intelligent Transportation Systems  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Babonneau, Jean-Philippe Vial |
Test Instances for the Multicommodity Flow Problem: An Erratum.  |
Operations Research  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jinfeng Li, Feng Chu, Christian Prins |
Lower and upper bounds for a capacitated plant location problem with multicommodity flow.  |
Computers & OR  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonah Sherman |
Breaking the Multicommodity Flow Barrier for sqrt(log(n))-Approximations to Sparsest Cut  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Frédéric Babonneau, Jean-Philippe Vial |
ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems: a corrigendum.  |
Math. Program.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Cynthia Barnhart, Niranjan Krishnan, Pamela H. Vance |
Multicommodity Flow Problems.  |
Encyclopedia of Optimization  |
2009 |
DBLP DOI BibTeX RDF |
Multicommodity network flows, Decomposition, Transportation, Column generation |
| 1 | Jonah Sherman |
Breaking the Multicommodity Flow Barrier for O(vlog n)-Approximations to Sparsest Cut.  |
FOCS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ankur Moitra |
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size.  |
FOCS  |
2009 |
DBLP DOI BibTeX RDF |
metric geometry, approximation algorithms, multicommodity flow |
| 1 | Siriphong Lawphongpanich |
Simplicial Decomposition.  |
Encyclopedia of Optimization  |
2009 |
DBLP DOI BibTeX RDF |
Carathéodory theorem, first order Taylor series expansion, Frank-Wolfe algorithm, Inner linearization, Master problem, Node-arc incidence matrix, Nonlinear dynamic network flow problem, Nonlinear multicommodity flow problems, Nonlinear single commodity network flow problem, Polyhedral set, Positive definite matrix, Pseudoconvexity, P-simplex, regularized Frank-Wolfe algorithm, Regularized subproblem, Restricted simplicial decomposition, Simplicial decomposition, Subproblem, Superlinear convergent rate, Traffic assignment problem, Side constraints, Linear program, Rank, Globally optimal, Convex hull, Nonlinear programming, Nonlinear program, Dimension, Column generation, Shortest path problem, Polyhedron, Restriction, Simplex algorithm, Extreme point, Dantzig-Wolfe decomposition, Convex combinations |
| 1 | Julia Chuzhoy, Sanjeev Khanna |
Polynomial flow-cut gaps and hardness of directed cut problems.  |
J. ACM  |
2009 |
DBLP DOI BibTeX RDF |
Directed multicut, hardness of approximation, sparsest cut |
| 1 | David Coudert, Napoleão Nepomuceno, Hervé Rivano |
Minimizing energy consumption by power-efficient radio configuration in fixed broadband wireless networks.  |
WOWMOM  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Muhammet Mustafa Ozdal |
Detailed-Routing Algorithms for Dense Pin Clusters in Integrated Circuits.  |
IEEE Trans. on CAD of Integrated Circuits and Systems  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Baltz, Anand Srivastav |
Multicast Routing and Design of Sparse Connectors.  |
Algorithmics of Large and Complex Networks ![In: Algorithmics of Large and Complex Networks - Design, Analysis, and Simulation [DFG priority program 1126], pp. 247-265, 2009, Springer, 978-3-642-02093-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Maren Martens |
A Simple Greedy Algorithm for the k-Disjoint Flow Problem.  |
TAMC  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Richa Agarwal, Özlem Ergun |
Mechanism design for a multicommodity flow game in service network alliances.  |
Oper. Res. Lett.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Agustín Bompadre, James B. Orlin |
A simple method for improving the primal simplex method for the multicommodity flow problem.  |
Networks  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel G. Espinoza, R. Garcia, Marcos Goycoolea, George L. Nemhauser, Martin W. P. Savelsbergh |
Per-Seat, On-Demand Air Transportation Part I: Problem Description and an Integer Multicommodity Flow Model.  |
Transportation Science  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri |
Multicommodity Flow, Well-linked Terminals and Routing Problems.  |
Encyclopedia of Algorithms  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ángel Marín, Esteve Codina |
Network design: taxi planning.  |
Annals OR  |
2008 |
DBLP DOI BibTeX RDF |
Aircraft routing and scheduling, Taxi planning, Airport management, Binary capacitated multicommodity flow network, Branch and Bound |
| 1 | T. J. M. Coenen, Maurits de Graaf, Richard J. Boucherie |
An upper bound on multi-hop multi-channel wireless network performance.  |
Mobility Conference  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Rabani, Leonard J. Schulman, Chaitanya Swamy |
Approximation algorithms for labeling hierarchical taxonomies.  |
SODA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael D. Moffitt |
MaizeRouter: Engineering an effective global router.  |
ASP-DAC  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Alex Fridman, Steven Weber, Kapil R. Dandekar, Moshe Kam |
Cross-layer multicommodity capacity expansion on ad hoc wireless networks of cognitive radios.  |
CISS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dahai Xu |
Optimal traffic engineering via Newtons method.  |
CISS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Baruch Awerbuch, Rohit Khandekar |
Stateless Near Optimal Flow Control with Poly-logarithmic Convergence.  |
LATIN  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Laleh Haerian Ardekani, Tiru S. Arthanari |
Traveling Salesman Problem and Membership in Pedigree Polytope - A Numerical Illustration.  |
MCO  |
2008 |
DBLP DOI BibTeX RDF |
Pedigree polytope, Multistage insertion formulation, Membership problem, Combinatorial optimization, Traveling salesman problem |
| 1 | Ziv Bar-Yossef, Ido Guy, Ronny Lempel, Yoëlle S. Maarek, Vladimir Soroka |
Cluster ranking with an application to mining mailbox networks.  |
Knowl. Inf. Syst.  |
2008 |
DBLP DOI BibTeX RDF |
Clustering, Communities, Social networks, Ranking, Graph algorithms, Social network analysis |
| 1 | Massimiliano Caramia, Antonino Sgalambro |
An exact approach for the maximum concurrent k -splittable flow problem.  |
Optimization Letters  |
2008 |
DBLP DOI BibTeX RDF |
k-splittable flow, Multicommodity, Throughput, Branch and bound, Mixed integer programming |
| 1 | Philippe Mahey, Maurício C. de Souza |
Local optimality conditions for multicommodity flow problems with separable piecewise convex costs.  |
Oper. Res. Lett.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Ouorou |
Implementing a proximal algorithm for some nonlinear multicommodity flow problems.  |
Networks  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Christophe Duhamel, Philippe Mahey |
Multicommodity flow problems with a bounded number of paths: A flow deviation approach.  |
Networks  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Filipe Pereira Alvelos, José M. Valério de Carvalho |
An extended model and a column generation algorithm for the planar multicommodity flow problem.  |
Networks  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Mehdi Ghatee, S. Mehdi Hashemi |
Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly.  |
Applied Mathematics and Computation  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Naveen Garg, Jochen Könemann |
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems.  |
SIAM J. Comput.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuanfang Hu, Yi Zhu, Michael Bedford Taylor, Chung-Kuan Cheng |
FPGA global routing architecture optimization using a multicommodity flow approach.  |
ICCD  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Cathy H. Xia, Donald F. Towsley, Chun Zhang |
Distributed Resource Management and Admission Control of Stream Processing Systems with Max Utility.  |
ICDCS  |
2007 |
DBLP DOI BibTeX RDF |
Multicommodity Flow Model, Distributed Algorithms, Stream Processing, Gradient Methods |
| 1 | Cüneyt F. Bazlamaçci, Fatih Say |
Minimum concave cost multicommodity network design.  |
Telecommunication Systems  |
2007 |
DBLP DOI BibTeX RDF |
Concave cost network design, Circuit switching and packet switching network design, Multicommodity flow problem |