Search results for "network design problems"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Michael Laszlo, Sumitra Mukherjee	An approximation algorithm for network design problems with downwards-monotone demand functions.	Optimization Letters	2008	DBLP DOI BibTeX RDF	Spanning forests, Approximation algorithms, Integer programs, Network design problems
2	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
2	Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha	On the approximability of some network design problems.	ACM Transactions on Algorithms	2008	DBLP DOI BibTeX RDF	cost-distance, fixed charge network flow, priority Steiner tree, network design, Hardness of approximation
2	Chandrashekhar Nagarajan, Yogeshwer Sharma, David P. Williamson	Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements.	WAOA	2008	DBLP DOI BibTeX RDF
2	Guy Even, Guy Kortsarz, Wolfgang Slany	On network design problems: fixed cost flows and the covering steiner problem.	ACM Transactions on Algorithms	2005	DBLP DOI BibTeX RDF	Optimization, approximation, graphs, theory, flow
2	Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha	On the approximability of some network design problems.	SODA	2005	DBLP DOI BibTeX RDF
2	Guy Even, Guy Kortsarz, Wolfgang Slany	On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem.	SWAT	2002	DBLP DOI BibTeX RDF
2	Sudipto Guha, Adam Meyerson, Kamesh Munagala	Hierarchical Placement and Network Design Problems.	FOCS	2000	DBLP DOI BibTeX RDF	subscriber loops, hierarchical placement, layered network design problems, constant approximations, bounded miss rates, minimum total cost, routing demand, layered caching scenarios, combinatorial approximation, multi-level facility location problem, load-balanced facility location problem, open facilities, access network design problem, resource allocation, facility location, cache storage, file organisation, approximation theory, hierarchical systems, network synthesis, hierarchical caching
2	Madhav V. Marathe, R. Ravi, Ravi Sundaram	Service-Constrained Network Design Problems.	SWAT	1996	DBLP DOI BibTeX RDF
2	Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III	Bicriteria Network Design Problems.	ICALP	1995	DBLP DOI BibTeX RDF
1	Iván A. Contreras, Elena Fernández	General network design: A unified view of combined location and network design problems.	European Journal of Operational Research	2012	DBLP DOI BibTeX RDF
1	Eugénia Moreira Bernardino, Anabela Moreira Bernardino, Juan Manuel Sánchez-Pérez, Juan Antonio Gómez Pulido, Miguel Ángel Vega Rodríguez	Solving large-scale SONET network design problems using bee-inspired algorithms.	Optical Switching and Networking	2012	DBLP DOI BibTeX RDF
1	Maria Kandyba-Chimani	Exact algorithms for network design problems using graph orientations.		2011	RDF
1	Guy Kortsarz, Zeev Nutov	Approximating some network design problems with node costs.	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
1	Parth H. Pathak, Rudra Dutta	A Survey of Network Design Problems and Joint Design Approaches in Wireless Mesh Networks.	IEEE Communications Surveys and Tutorials	2011	DBLP DOI BibTeX RDF
1	Debmalya Panigrahi	Survivable Network Design Problems in Wireless Networks.	SODA	2011	DBLP BibTeX RDF
1	Fabio D'Andreagiovanni	On Improving the Capacity of Solving Large-scale Wireless Network Design Problems by Genetic Algorithms.	EvoApplications	2011	DBLP DOI BibTeX RDF
1	Stefan Gollowitzer, Luis Gouveia, Ivana Ljubic	A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes.	INOC	2011	DBLP DOI BibTeX RDF
1	Viswanath Nagarajan, R. Ravi, Mohit Singh	Simpler analysis of LP extreme points for traveling salesman and survivable network design problems.	Oper. Res. Lett.	2010	DBLP DOI BibTeX RDF
1	Tolga Bektas, Mervat Chouman, Teodor Gabriel Crainic	Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints.	Networks	2010	DBLP DOI BibTeX RDF
1	Ying-Hua Chang	Adopting co-evolution and constraint-satisfaction concept on genetic algorithms to solve supply chain network design problems.	Expert Syst. Appl.	2010	DBLP DOI BibTeX RDF
1	Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis	On Generalizations of Network Design Problems with Degree Bounds	CoRR	2010	DBLP BibTeX RDF
1	Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar	An Oblivious Spanning Tree for Buy-at-Bulk Network Design Problems	CoRR	2010	DBLP BibTeX RDF
1	Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis	On Generalizations of Network Design Problems with Degree Bounds.	IPCO	2010	DBLP DOI BibTeX RDF
1	Marie Pelleau, Pascal Van Hentenryck, Charlotte Truchet	Sonet Network Design Problems	LSCS	2009	DBLP DOI BibTeX RDF
1	Raja Jothi, Balaji Raghavachari	Improved approximation algorithms for the single-sink buy-at-bulk network design problems.	J. Discrete Algorithms	2009	DBLP DOI BibTeX RDF
1	Dietmar Cieslik	Network Design Problems.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Steiner minimal tree, Network, Shortest path, Minimum spanning trees, Network flows
1	Meng Xu, Jin Yang, Ziyou Gao	Using One-at-a-Time Sensitivity Analysis Designs for Genetic Algorithm Solving Continuous Network Design Problems.	CSO	2009	DBLP DOI BibTeX RDF
1	Dalila B. M. M. Fontes, José Fernando Gonçalves	A Multi-population Genetic Algorithm for Tree-shaped Network Design Problems.	IJCCI	2009	DBLP BibTeX RDF
1	Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi	Online and stochastic survivable network design.	STOC	2009	DBLP DOI BibTeX RDF	approximation algorithms, online algorithms, network design problems
1	Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh	Compacting cuts: A new linear formulation for minimum cut.	ACM Transactions on Algorithms	2009	DBLP DOI BibTeX RDF	Linear programming formulation complexity, minimum cut problem
1	Binay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi	Approximation Algorithms for a Network Design Problem.	COCOON	2009	DBLP DOI BibTeX RDF
1	Chandra Chekuri, Nitish Korula	A Graph Reduction Step Preserving Element-Connectivity and Applications.	ICALP	2009	DBLP DOI BibTeX RDF
1	Jiong Guo, Rolf Niedermeier, Ondrej Suchý	Parameterized Complexity of Arc-Weighted Directed Steiner Problems.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour	Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees.	Algorithmica	2009	DBLP DOI BibTeX RDF
1	Crina Grosan, Ajith Abraham, Aboul Ella Hassanien	Designing resilient networks using multicriteria metaheuristics.	Telecommunication Systems	2009	DBLP DOI BibTeX RDF	Resilient networks, Pareto solutions, Multiobjective optimization, Metaheuristics
1	Cara Cocking	Solutions to facility location-network design problems.		2008	RDF
1	Chandra Chekuri, F. Bruce Shepherd	Approximate Integer Decompositions for Undirected Network Design Problems.	SIAM J. Discrete Math.	2008	DBLP DOI BibTeX RDF
1	Chandra Chekuri, Nitish Korula, Martin Pál	Improved algorithms for orienteering and related problems.	SODA	2008	DBLP DOI BibTeX RDF
1	Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Rothvoß, Guido Schäfer	Approximating connected facility location problems via random facility sampling and core detouring.	SODA	2008	DBLP DOI BibTeX RDF
1	Nikhil Bansal, Rohit Khandekar, Viswanath Nagarajan	Additive guarantees for degree bounded directed network design.	STOC	2008	DBLP DOI BibTeX RDF	approximation algorithms, directed graphs, network design
1	Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Kong Yung	Degree Bounded Network Design with Metric Costs.	FOCS	2008	DBLP DOI BibTeX RDF
1	Jiang-bo Zheng	A Modeling Framework for the Planning of Logistics Nodes in Strategic Supply Chain Based on Complex Network.	ISECS	2008	DBLP DOI BibTeX RDF	Strategic Supply Chain, Logistics Nodes, Complex Network
1	Belén Melián, José L. Verdegay	Fuzzy Optimization Models for the Design of WDM Networks.	IEEE T. Fuzzy Systems	2008	DBLP DOI BibTeX RDF
1	Anke van Zuylen	Deterministic Sampling Algorithms for Network Design.	ESA	2008	DBLP DOI BibTeX RDF
1	Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko	Approximating Minimum-Power Degree and Connectivity Problems.	LATIN	2008	DBLP DOI BibTeX RDF
1	Baruch Awerbuch, Rohit Khandekar	On cost sharing mechanisms in the network design game.	PODC	2007	DBLP DOI BibTeX RDF	network design, cost sharing
1	Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh	Compacting cuts: a new linear formulation for minimum cut.	SODA	2007	DBLP DOI BibTeX RDF
1	Chandra Chekuri	Routing and network design with robustness to changing or uncertain traffic demands.	SIGACT News	2007	DBLP DOI BibTeX RDF
1	Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál	Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy.	ACM Transactions on Algorithms	2007	DBLP DOI BibTeX RDF	Steiner forests, Approximation algorithms, network design, cost sharing
1	Dijiang Huang, Manish Mehta 0003, Appie van de Liefvoort, Deep Medhi	Modeling pairwise key establishment for random key predistribution in large-scale sensor networks.	IEEE/ACM Trans. Netw.	2007	DBLP DOI BibTeX RDF	random key distributions, security, sensor networks
1	Lin Lin, Mitsuo Gen	A bicriteria shortest path routing problems by hybrid genetic algorithm in communication networks.	IEEE Congress on Evolutionary Computation	2007	DBLP DOI BibTeX RDF
1	Beatrice M. Ombuki-Berman, Mario Ventresca	Search Difficulty of Two-Connected Ring-based Topological Network Designs.	FOCI	2007	DBLP DOI BibTeX RDF
1	Eduardo G. Carrano, Carlos M. Fonseca, Ricardo H. C. Takahashi, Luciano C. A. Pimenta, Oriane M. Neto	A preliminary comparison of tree encoding schemes for evolutionary algorithms.	SMC	2007	DBLP DOI BibTeX RDF
1	Yuval Lando, Zeev Nutov	On Minimum Power Connectivity Problems.	ESA	2007	DBLP DOI BibTeX RDF
1	Takuro Fukunaga, Hiroshi Nagamochi	The Set Connector Problem in Graphs.	IPCO	2007	DBLP DOI BibTeX RDF
1	Tim Roughgarden, Mukund Sundararajan	Optimal Efficiency Guarantees for Network Design Mechanisms.	IPCO	2007	DBLP DOI BibTeX RDF
1	Mohamed Haouari, Mehdi Mrad, Hanif D. Sherali	Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements.	Optimization Letters	2007	DBLP DOI BibTeX RDF	Synthesis of capacitated networks, Network design, Benders decomposition
1	Anupam Gupta, Mohammad Taghi Hajiaghayi, Harald Räcke	Oblivious network design.	SODA	2006	DBLP DOI BibTeX RDF
1	Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour	Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design.	FOCS	2006	DBLP DOI BibTeX RDF
1	Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour	Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
1	Zeev Nutov	Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
1	Eduardo G. Carrano, Ricardo H. C. Takahashi, Carlos M. Fonseca, Oriane M. Neto	Bi-objective Combined Facility Location and Network Design.	EMO	2006	DBLP DOI BibTeX RDF
1	Belén Melián-Batista	Using Memory to Improve the VNS Metaheuristic for the Design of SDH/WDM Networks.	Hybrid Metaheuristics	2006	DBLP DOI BibTeX RDF
1	Damianos Gavalas, Grammati E. Pantziou, Charalampos Konstantopoulos, Basilis Mamalis	A Method for Incremental Data Fusion in Distributed Sensor Networks.	AIAI	2006	DBLP DOI BibTeX RDF
1	R. Ravi	Matching Based Augmentations for Approximating Connectivity Problems.	LATIN	2006	DBLP DOI BibTeX RDF
1	José R. Correa, Cristina G. Fernandes, Yoshiko Wakabayashi	Approximating Rational Objectives Is as Easy as Approximating Linear Ones.	SWAT	2006	DBLP DOI BibTeX RDF
1	Ashish Goel, Adam Meyerson	Simultaneous Optimization via Approximate Majorization for Concave Profits or Convex Costs.	Algorithmica	2006	DBLP DOI BibTeX RDF	Simultaneous optimization, Fairness
1	Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos	Energy-Efficient Wireless Network Design.	Theory Comput. Syst.	2006	DBLP DOI BibTeX RDF
1	Thomas L. Magnanti, S. Raghavan	Strong formulations for network design problems with connectivity requirements.	Networks	2005	DBLP DOI BibTeX RDF
1	Roberto Aringhieri, Mauro Dell'Amico	Comparing Metaheuristic Algorithms for Sonet Network Design Problems.	J. Heuristics	2005	DBLP DOI BibTeX RDF	SONET ring, optical networks, metaheuristics, graph partitioning
1	Alysson M. Costa	A survey on benders decomposition applied to fixed-charge network design problems.	Computers & OR	2005	DBLP DOI BibTeX RDF
1	Ara Hayrapetyan, Chaitanya Swamy, Éva Tardos	Network design for information networks.	SODA	2005	DBLP DOI BibTeX RDF
1	Antonio Nucci, Ashwin Sridharan, Nina Taft	The problem of synthetically generating IP traffic matrices: initial recommendations.	Computer Communication Review	2005	DBLP DOI BibTeX RDF	internet traffic matrices, testing, topology, traffic characterization, hypothesis, distribution fitting
1	Giampaolo L. Libralao, Telma Woerle de Lima, Karen Honda, Alexandre C. B. Delbem	Node-depth encoding for directed graphs.	Congress on Evolutionary Computation	2005	DBLP DOI BibTeX RDF
1	Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz	Building Edge-Failure Resilient Networks.	Algorithmica	2005	DBLP DOI BibTeX RDF	Backup path, Approximation algorithm, Network design, Restoration, Link failure
1	Tommy Thomadsen, Thomas Stidsen	Hierarchical Ring Network Design Using Branch-and-Price.	Telecommunication Systems	2005	DBLP DOI BibTeX RDF	ring network design, hierarchical network design, branch-and-price
1	Guy Kortsarz, Robert Krauthgamer, James R. Lee	Hardness of Approximation for Vertex-Connectivity Network Design Problems.	SIAM J. Comput.	2004	DBLP DOI BibTeX RDF
1	Raja Jothi, Balaji Raghavachari	Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems.	SWAT	2004	DBLP DOI BibTeX RDF
1	Lisa Fleischer	A fast approximation scheme for fractional covering problems with variable upper bounds.	SODA	2004	DBLP DOI BibTeX RDF
1	Adam Meyerson	Online algorithms for network design.	SPAA	2004	DBLP DOI BibTeX RDF
1	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
1	Anupam Gupta, R. Ravi, Amitabh Sinha	An Edge in Time Saves Nine: LP Rounding Approximation Algorithms for Stochastic Network Design.	FOCS	2004	DBLP DOI BibTeX RDF
1	Cynthia Barnhart, Su Shen	Logistics Service Network Design for Time-Critical Delivery.	PATAT	2004	DBLP DOI BibTeX RDF
1	Corinne Feremans, Martine Labbé, Gilbert Laporte	Generalized network design problems.	European Journal of Operational Research	2003	DBLP DOI BibTeX RDF
1	Filipe F. Mazzini, Geraldo Robson Mateus, James MacGregor Smith	Lagrangean Based Methods for Solving Large-Scale Cellular Network Design Problems.	Wireless Networks	2003	DBLP DOI BibTeX RDF	cellular network design, frequency channel assignment, base station location, optimization, algorithms
1	Vojtech Bálint	The non-approximability of bicriteria network design problems.	J. Discrete Algorithms	2003	DBLP DOI BibTeX RDF
1	Anupam Gupta, Amit Kumar, Tim Roughgarden	Simpler and better approximation algorithms for network design.	STOC	2003	DBLP DOI BibTeX RDF	approximation algorithms, randomized algorithms, network design
1	Alexandre C. B. Delbem, André Carlos Ponce Leon Ferreira de Carvalho	A Forest Representation for Evolutionary Algorithms Applied to Network Design.	GECCO	2003	DBLP DOI BibTeX RDF
1	Rajeev Kumar, Nilanjan Banerjee	Multicriteria Network Design Using Evolutionary Algorithm.	GECCO	2003	DBLP DOI BibTeX RDF
1	Rajeev Kumar	Multicriteria Network Design Using Distributed Evolutionary Algorithm.	HiPC	2003	DBLP DOI BibTeX RDF
1	Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos	Energy-Efficient Wireless Network Design.	ISAAC	2003	DBLP DOI BibTeX RDF
1	James W. George, Charles S. Revelle	Bi-Objective Median Subtree Location Problems.	Annals OR	2003	DBLP DOI BibTeX RDF	extensive facility location, structure location, tree, network design, median, multiobjective
1	Fulya Altiparmak, Berna Dengiz, Alice E. Smith	Optimal Design of Reliable Computer Networks: A Comparison of Metaheuristics.	J. Heuristics	2003	DBLP DOI BibTeX RDF	hillclimbing, genetic algorithms, simulated annealing, network design, memetic algorithm, network reliability
1	Guy Kortsarz, Robert Krauthgamer, James R. Lee	Hardness of Approximation for Vertex-Connectivity Network-Design Problems.	APPROX	2002	DBLP DOI BibTeX RDF
1	Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz	Building Edge-Failure Resilient Networks.	IPCO	2002	DBLP BibTeX RDF
1	James W. George, Charles S. Revelle, John R. Current	The Maximum Utilization Subtree Problem.	Annals OR	2002	DBLP DOI BibTeX RDF
1	Anantaram Balakrishnan, Thomas L. Magnanti, Prakash Mirchandani	Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems.	Oper. Res. Lett.	2001	DBLP DOI BibTeX RDF
1	R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III	Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems.	Algorithmica	2001	DBLP DOI BibTeX RDF
1	Sanjay Melkote, Mark S. Daskin	Capacitated facility location/network design problems.	European Journal of Operational Research	2001	DBLP DOI BibTeX RDF