Search results for "Multicommodity"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
82	Jordi Castro 0001	Solving Difficult Multicommodity Problems with a Specialized Interior-Point Algorithm.	Ann. Oper. Res.	2003	DBLP DOI BibTeX RDF	linear programming, interior-point methods, multicommodity flows, network optimization
77	Frank Thomson Leighton, Ankur Moitra	Extensions and limits to vertex sparsification.	STOC	2010	DBLP DOI BibTeX RDF	oblivious reductions, multicommodity flow
70	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
70	Lisa Fleischer	Approximating Fractional Multicommodity Flow Independent of the Number of Commodities.	FOCS	1999	DBLP DOI BibTeX RDF	approximation algorithms, network flow, multicommodity flow
70	Mustafa Ç. Pinar, Stavros A. Zenios	A data-level parallel linear-quadratic penalty algorithm for multicommodity network flows.	ACM Trans. Math. Softw.	1994	DBLP DOI BibTeX RDF	massively parallel algorithms, multicommodity network problems, parallel optimization
65	Andrew V. Goldberg, Jeffrey D. Oldham, Serge A. Plotkin, Clifford Stein 0001	An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow.	IPCO	1998	DBLP DOI BibTeX RDF
63	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
58	George Karakostas	Faster approximation schemes for fractional multicommodity flow problems.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	Multicommodity flows, fully-polynomial time approximation schemes
58	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
58	Margarida Moz, Margarida Vaz Pato	Solving the Problem of Rerostering Nurse Schedules with Hard Constraints: New Multicommodity Flow Models.	Ann. Oper. Res.	2004	DBLP DOI BibTeX RDF	rerostering, integer multicommodity flow problems, binary linear programming, nurse scheduling
58	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
58	Margarida Moz, Margarida Vaz Pato	An Integer Multicommodity Flow Model Applied to the Rerostering of Nurse Schedules.	Ann. Oper. Res.	2003	DBLP DOI BibTeX RDF	employee scheduling, rerostering, integer multicommodity flow problems, integer linear programming
58	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
53	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
53	Lisa Fleischer, Kamal Jain, Mohammad Mahdian	Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games.	FOCS	2004	DBLP DOI BibTeX RDF
53	Amit Kumar 0001, Anupam Gupta 0001, Tim Roughgarden	A Constant-Factor Approximation Algorithm for the Multicommodity.	FOCS	2002	DBLP DOI BibTeX RDF
53	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
48	Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman	Single source multiroute flows and cuts on uniform capacity networks.	SODA	2007	DBLP BibTeX RDF
48	Matthew Andrews, Kyomin Jung, Alexander L. Stolyar	Stability of the max-weight routing and scheduling protocol in dynamic networks and at critical loads.	STOC	2007	DBLP DOI BibTeX RDF	scheduling, routing, stability
46	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
46	Tobias Harks, Stefan Heinz 0001, Marc E. Pfetsch	Competitive Online Multicommodity Routing.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Online network optimization, Multicommodity routing, Competitive analysis, Unsplittable flow
46	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
46	Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd	Multicommodity demand flow in a tree and packing integer programs.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	Integer multicommodity flow, packing integer program, approximation algorithm, tree, integrality gap
46	Cüneyt F. Bazlamaçci, Fatih Say	Minimum concave cost multicommodity network design.	Telecommun. Syst.	2007	DBLP DOI BibTeX RDF	Concave cost network design, Circuit switching and packet switching network design, Multicommodity flow problem
46	Kumar Padmanabh, Rajarshi Roy 0001	Multicommodity Flow Based Maximum Lifetime Routing in Wireless Sensor Network.	ICPADS (1)	2006	DBLP DOI BibTeX RDF	Multicommodity Flow Maximum Lifetime routing, Wireless Sensor Network, Routing Protocol
46	Moses Charikar, Adriana Karagiozova	On non-uniform multicommodity buy-at-bulk network design.	STOC	2005	DBLP DOI BibTeX RDF	buy-at-bulk, multicommodity, approximation algorithms, network design, non-uniform
46	Ilfat Ghamlouche, Teodor Gabriel Crainic, Michel Gendreau	Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design.	Ann. Oper. Res.	2004	DBLP DOI BibTeX RDF	fixed-charge capacitated multicommodity network design, cycle-based neighbourhoods, tabu search, meta-heuristics, path relinking
46	Nadia Cobos Zaleta, Ada Margarita Alvarez Socarrás	Tabu Search-based algorithm for Capacitated Multicommodity Network Design Problem.	CONIELECOMP	2004	DBLP DOI BibTeX RDF	multicommodity networks, Tabu Search, network design
46	Bernard Gendron, Jean-Yves Potvin, Patrick Soriano	A Tabu Search with Slope Scaling for the Multicommodity Capacitated Location Problem with Balancing Requirements.	Ann. Oper. Res.	2003	DBLP DOI BibTeX RDF	multicommodity capacitated location with balancing requirements, slope scaling, tabu search
41	Elona Erez, Meir Feder	Improving the multicommodity flow rates with network codes for two sources.	IEEE J. Sel. Areas Commun.	2009	DBLP DOI BibTeX RDF
41	Yi-Kuei Lin	System Reliability of a Limited-Flow Network in Multicommodity Case.	IEEE Trans. Reliab.	2007	DBLP DOI BibTeX RDF
41	Baruch Awerbuch, Rohit Khandekar	Distributed network monitoring and multicommodity flows: a primal-dual approach.	PODC	2007	DBLP DOI BibTeX RDF	passive network measurement, distributed algorithms, multi-commodity flows
41	Rudolf Fleischer, Jian Li 0015, Shijun Tian, Hong Zhu 0004	Non-metric Multicommodity and Multilevel Facility Location.	AAIM	2006	DBLP DOI BibTeX RDF
41	R. Ravi 0001, Amitabh Sinha	Multicommodity facility location.	SODA	2004	DBLP BibTeX RDF
41	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
41	Ying Du, Danny Z. Chen, Xiaodong Wu 0001	Approximation Algorithms for Multicommodity Flow and Normalized Cut Problems: Implementations and Experimental Study.	COCOON	2004	DBLP DOI BibTeX RDF
41	Meinolf Sellmann, Norbert Sensen, Larissa Timajev	Multicommodity Flow Approximation Used for Exact Graph Partitioning.	ESA	2003	DBLP DOI BibTeX RDF
41	Lisa Fleischer, Martin Skutella	The Quickest Multicommodity Flow Problem.	IPCO	2002	DBLP DOI BibTeX RDF
41	George Karakostas	Faster approximation schemes for fractional multicommodity flow problems.	SODA	2002	DBLP BibTeX RDF
41	Michel Minoux	Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods.	Ann. Oper. Res.	2001	DBLP DOI BibTeX RDF
41	Norbert Sensen	Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows.	ESA	2001	DBLP DOI BibTeX RDF
41	Jordi Castro 0001, Antonio Frangioni	A Parallel Implementation of an Interior-Point Algorithm for Multicommodity Network Flows.	VECPAR	2000	DBLP DOI BibTeX RDF
41	Naveen Garg 0001, Jochen Könemann	Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems.	FOCS	1998	DBLP DOI BibTeX RDF
41	Hiroshi Hirai 0001	The maximum multiflow problems with bounded fractionality.	STOC	2010	DBLP DOI BibTeX RDF	metrics, polynomial time algorithms, multicommodity flows
41	Guy Kortsarz, Zeev Nutov	Approximating Some Network Design Problems with Node Costs.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF	Node costs, Multicommodity Buy at Bulk, Covering tree, Approximation algorithm, Network design, Hardness of approximation
41	Tom Coenen, Maurits de Graaf, Richard J. Boucherie	An Upper Bound on Multi-hop Wireless Network Performance.	ITC	2007	DBLP DOI BibTeX RDF	cut condition, interference, Wireless multi-hop network, multicommodity flow problem
41	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
41	Nicholas J. A. Harvey, Robert D. Kleinberg, April Rasala Lehman	On the capacity of information networks.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF	infomational dominance, k-pairs communication problems, multiple unicast sessions, capacity, network coding, multicommodity flow, sparsity
41	Sanjeet Singh, Pankaj Gupta, Davinder Bhatia	On Multiparametric Sensitivity Analysis in Minimum Cost Network Flow Problem.	ICCSA (4)	2005	DBLP DOI BibTeX RDF	multicommodity minimum cost network flow, multiparametric sensitivity analysis, tolerance approach, parametric analysis, Minimum cost network flow
41	Jordi Castro 0001	Network Flows Heuristics for Complementary Cell Suppression: An Empirical Evaluation and Extensions.	Inference Control in Statistical Databases	2002	DBLP DOI BibTeX RDF	Complementary cell suppression problem, network flows with side constraints, multicommodity network flows, linear programming, network optimization
36	Richard Cole 0001, Yevgeniy Dodis, Tim Roughgarden	Bottleneck links, variable demand, and the tragedy of the commons.	SODA	2006	DBLP DOI BibTeX RDF
36	C. D. Randazzo, Henrique Pacca Loureiro Luna	A Comparison of Optimal Methods for Local Access Uncapacitated Network Design.	Ann. Oper. Res.	2001	DBLP DOI BibTeX RDF	branch-and-bound, network design, branch-and-cut, Benders decomposition
36	Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu, Sudhakar Muddu, Alexander Zelikovsky	Practical Approximation Algorithms for Separable Packing Linear Programs.	WADS	2001	DBLP DOI BibTeX RDF
36	Robert C. Carden IV, Jianmin Li, Chung-Kuan Cheng	A global router with a theoretical bound on the optimal solution.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1996	DBLP DOI BibTeX RDF
34	Richard D. Wollmer	Multicommodity networks with resource constraints: The generalized multicommodity flow problem.	Networks	1971	DBLP DOI BibTeX RDF
34	Pierre Chardaire, Abdel Lisser	Nonoriented Multicommodity Flow Problems.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Network, Multicommodity flow, Decomposition algorithms
34	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
34	Mohamad K. Hasan	Multimodal, multicommodity international freight simultaneous transportation network equilibrium model.	Telecommun. Syst.	2009	DBLP DOI BibTeX RDF	International multimodal multicommodity network, Simultaneous transportation network equilibrium model, Integrated transport network, Integrated transport system, Globalization and regional integration, International freight transport, Importers, Exporters
34	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
34	James Broberg, Zhen Liu 0001, 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
34	Teodor Gabriel Crainic, Bernard Gendron, Geneviève Hernu	A Slope Scaling/Lagrangean Perturbation Heuristic with Long-Term Memory for Multicommodity Capacitated Fixed-Charge Network Design.	J. Heuristics	2004	DBLP DOI BibTeX RDF	slope scaling, Lagrangean heuristic, multicommodity capacitated fixed-charge network design, long-term memory
34	Garng M. Huang, Shan Zhu	A fast distributed optimal routing algorithm for multicommodity large data networks.	IPPS	1995	DBLP DOI BibTeX RDF	fast distributed optimal routing algorithm, multicommodity large data networks, large data network, multicommodities, parallel time complexity, flow demand, OPNET simulation tool, computational complexity, distributed algorithms
34	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
34	Philip N. Klein, Ajit Agrawal, R. Ravi 0001, Satish Rao	Approximation through Multicommodity Flow	FOCS	1990	DBLP DOI BibTeX RDF	minimum deletion, max-flow-min-cut theorem, approximation algorithms, multicommodity flow
34	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
29	George Karakostas, Stavros G. Kolliopoulos	Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands.	Algorithmica	2009	DBLP DOI BibTeX RDF	Taxes, Elastic demand, Price of anarchy, Traffic equilibrium
29	George Karakostas, Stavros G. Kolliopoulos	Stackelberg Strategies for Selfish Routing in General Multicommodity Networks.	Algorithmica	2009	DBLP DOI BibTeX RDF	Stackelberg strategies, Price of anarchy, Selfish routing
29	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
29	Ritesh Madan, Devavrat Shah, Olivier Lévêque	Product Multicommodity Flow in Wireless Networks.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
29	Jochen Könemann, Ojas Parekh, David Pritchard	Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees.	WAOA	2008	DBLP DOI BibTeX RDF
29	DongMei Xing	Nonmetric Multicommodity Facility Location and K-Median Problem with Service Installation Costs.	CSSE (3)	2008	DBLP DOI BibTeX RDF
29	Alex Fridman 0001, Steven Weber 0001, Kapil R. Dandekar, Moshe Kam	Cross-layer multicommodity capacity expansion on ad hoc wireless networks of cognitive radios.	CISS	2008	DBLP DOI BibTeX RDF
29	Luca Becchetti, Jochen Könemann, Stefano Leonardi 0001, Martin Pál	Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	Steiner forests, Approximation algorithms, network design, cost sharing
29	Alexander Hall, Katharina Langkau, Martin Skutella	An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times.	Algorithmica	2007	DBLP DOI BibTeX RDF
29	Baruch Awerbuch, Rohit Khandekar, Satish Rao	Distributed algorithms for multicommodity flow problems via approximate steepest descent framework.	SODA	2007	DBLP BibTeX RDF
29	João F. M. Sarubbi, Geraldo Robson Mateus, Henrique Pacca Loureiro Luna, Gilberto de Miranda Jr.	Model and algorithms for the Multicommodity Traveling Salesman Problem.	HIS	2007	DBLP DOI BibTeX RDF
29	Tobias Harks, Stefan Heinz 0001, Marc E. Pfetsch	Competitive Online Multicommodity Routing.	WAOA	2006	DBLP DOI BibTeX RDF
29	George Karakostas, Stavros G. Kolliopoulos	Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands.	COCOON	2006	DBLP DOI BibTeX RDF
29	Ada M. Alvarez, José Luis González Velarde, Karim De-Alba	Grasp Embedded Scatter Search for the Multicommodity Capacitated Network Design Problem.	J. Heuristics	2005	DBLP DOI BibTeX RDF	Scater Search, network design, GRASP
29	Luca Becchetti, Jochen Könemann, Stefano Leonardi 0001, Martin Pál	Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy.	SODA	2005	DBLP BibTeX RDF
29	Garima Batra, Naveen Garg 0001, Garima Gupta	Heuristic Improvements for Computing Maximum Multicommodity Flow and Minimum Multicut.	ESA	2005	DBLP DOI BibTeX RDF
29	George Karakostas, Stavros G. Kolliopoulos	Edge Pricing of Multicommodity Networks for Heterogeneous Selfish Users.	FOCS	2004	DBLP DOI BibTeX RDF
29	Krzysztof Walkowiak	On Application of Ant Algorithms to Non-bifurcated Multicommodity Flow Problem.	ICAISC	2004	DBLP DOI BibTeX RDF
29	Anupam Gupta 0001, Amit Kumar 0001, Martin Pál, Tim Roughgarden	Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem.	FOCS	2003	DBLP DOI BibTeX RDF
29	Alexander Hall, Steffen Hippler, Martin Skutella	Multicommodity Flows over Time: Efficient Algorithms and Complexity.	ICALP	2003	DBLP DOI BibTeX RDF	flow over time, dynamic flow, routing, complexity, network flow, efficient algorithm
29	Evangelos Markakis, Amin Saberi	On the core of the multicommodity flow game.	EC	2003	DBLP DOI BibTeX RDF	duality, core, cooperative games
29	Alexander Hall, Katharina Langkau, Martin Skutella	An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
29	Oktay Günlük	A New Min-Cut Max-Flow Ratio for Multicommodity Flows.	IPCO	2002	DBLP DOI BibTeX RDF
29	Susanne Albers, Carsten Witt	Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows.	RANDOM-APPROX	2001	DBLP DOI BibTeX RDF
29	S. Muthukrishnan 0001, Torsten Suel	Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow.	RANDOM	1998	DBLP DOI BibTeX RDF
29	Karsten Weihe	Multicommodity Flows in Even, Planar Networks.	ISAAC	1993	DBLP DOI BibTeX RDF
29	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
29	Peng-Jun Wan	Multiflows in multihop wireless networks.	MobiHoc	2009	DBLP DOI BibTeX RDF	approximation algorithms, multicommodity flow, capacity region
29	Ángel Marín, Esteve Codina	Network design: taxi planning.	Ann. Oper. Res.	2008	DBLP DOI BibTeX RDF	Aircraft routing and scheduling, Taxi planning, Airport management, Binary capacitated multicommodity flow network, Branch and Bound
29	Massimiliano Caramia, Antonino Sgalambro	An exact approach for the maximum concurrent k -splittable flow problem.	Optim. Lett.	2008	DBLP DOI BibTeX RDF	k-splittable flow, Multicommodity, Throughput, Branch and bound, Mixed integer programming
29	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
29	Chandra Chekuri, Sanjeev Khanna	Edge-disjoint paths revisited.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	multicommodity flow relaxation, approximation algorithm, greedy algorithm, Edge-disjoint paths
29	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
29	Ángel Marín	Airport management: taxi planning.	Ann. Oper. Res.	2006	DBLP DOI BibTeX RDF	Aircraft routing and scheduling, Taxi Planning, Airport management, Binary capacitated multicommodity flow network, Fix and Relax, Branch and Bound
29	Christina Fragouli, Tarik Tabet	On conditions for constant throughput in wireless networks.	ACM Trans. Sens. Networks	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