Search results for "capacitated"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
67	Hans L. Bodlaender, Daniel Lokshtanov, Eelko Penninkx	Planar Capacitated Dominating Set Is W[1]-Hard.	IWPEC	2009	DBLP DOI BibTeX RDF
67	Michael Dom, Daniel Lokshtanov, Saket Saurabh 0001, Yngve Villanger	Capacitated Domination and Covering: A Parameterized Perspective.	IWPEC	2008	DBLP DOI BibTeX RDF
56	Jose Emmanuel Ramirez-Marquez, Bethel A. Gebre	A Classification Tree Based Approach for the Development of Minimal Cut and Path Vectors of a Capacitated Network.	IEEE Trans. Reliab.	2007	DBLP DOI BibTeX RDF
56	Mong-Jen Kao, Chung-Shou Liao	Capacitated Domination Problem.	ISAAC	2007	DBLP DOI BibTeX RDF
55	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
54	Guy Even, Retsef Levi, Dror Rawitz, Baruch Schieber, Shimon Shahar, Maxim Sviridenko	Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	capacitated covering, rectangle stabbing, Approximation algorithms, lot sizing
54	Nacima Labadi, Christian Prins, Mohamed Reghioui	An Evolutionary Algorithm with Distance Measure for the Split Delivery Capacitated Arc Routing Problem.	Recent Advances in Evolutionary Computation for Combinatorial Optimization	2008	DBLP DOI BibTeX RDF	Capacitated Arc Routing Problem, Split Delivery, Population Management, Memetic Algorithm, Distance Measure
54	Kai Sun, Genke Yang, Yu-Wang Chen	Hybrid Scatter Search with Extremal Optimization for Solving the Capacitated Vehicle Routing Problem.	ICIC (2)	2008	DBLP DOI BibTeX RDF	Capacitated vehicle routing problem, Scatter search, Extremal optimization
54	Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Harald Räcke, Tom Leighton	Oblivious routing on node-capacitated and directed graphs.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	node-capacitated graphs, directed graphs, communication networks, Oblivious routing
54	Sergei Chubanov, Mikhail Y. Kovalyov, Erwin Pesch	An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure.	Math. Program.	2006	DBLP DOI BibTeX RDF	Capacitated economic lot-sizing problem, Dynamic programming, Fully polynomial time approximation scheme
54	Zhipeng Cai 0001, Guohui Lin, Guoliang Xue	Improved Approximation Algorithms for the Capacitated Multicast Routing Problem.	COCOON	2005	DBLP DOI BibTeX RDF	Capacitated Multicast Routing, Approximation Algorithm, Tree Partitioning, Steiner Minimum Tree
54	Jiawei Zhang 0006, Bo Chen 0002, Yinyu Ye 0001	A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem: (Extended Abstract).	IPCO	2004	DBLP DOI BibTeX RDF	capacitated facility location, approximation algorithm, local search algorithm
45	Mohamed Zied Ben Hamouda, Olivier Brun, Jean-Marie Garcia	A Tabu Search heuristic for capacitated network design.	ISCC	2009	DBLP DOI BibTeX RDF
45	Fehmi Tanrisever, Erhan Kutanoglu	Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem.	Ann. Oper. Res.	2008	DBLP DOI BibTeX RDF	Job formation, Multi-order jobs, Scheduling, Dynamic programming, Batching
45	Caroline Prodhon	Solving the capacitated location-routing problem.	4OR	2007	DBLP DOI BibTeX RDF	MSC Classification 90B06
45	Retsef Levi, Andrea Lodi 0001, Maxim Sviridenko	Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities.	IPCO	2007	DBLP DOI BibTeX RDF	scheduling theory and algorithms, approximation algorithms, integer programming, randomized algorithms, polyhedral combinatorics
45	Reuven Bar-Yehuda, Guy Flysher, Julián Mestre, Dror Rawitz	Approximation of Partial Capacitated Vertex Cover.	ESA	2007	DBLP DOI BibTeX RDF
45	Luca Bertazzi, Maria Grazia Speranza	Rounding Procedures for the Discrete Version of the Capacitated Economic Order Quantity Problem.	Ann. Oper. Res.	2001	DBLP DOI BibTeX RDF	EOQ, logistics, worst-case analysis
43	Saman Eskandarzadeh, Reza Tavakkoli-Moghaddam, Amir Azaron	An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems.	J. Comb. Optim.	2009	DBLP DOI BibTeX RDF	Capacitated arc routing, Monotropic and integer programming, Nonlinear programming, Lagrangian relaxation
43	Sandra Ulrich Ngueveu, Christian Prins, Roberto Wolfler Calvo	An Effective Evolutionary Algorithm for the Cumulative Capacitated Vehicle Routing Problem.	EvoWorkshops	2009	DBLP DOI BibTeX RDF	routing for relief, cumulative capacitated vehicle routing problem, traveling repairman problem, minimum latency, Metaheuristic
43	Michael Polacek, Karl F. Doerner, Richard F. Hartl, Vittorio Maniezzo	A variable neighborhood search for the capacitated arc routing problem with intermediate facilities.	J. Heuristics	2008	DBLP DOI BibTeX RDF	Capacitated arc routing problem, Intermediate facilities, Tour length restriction, Variable neighborhood search
43	Vittorio Maniezzo, Matteo Roffilli	Algorithms for Large Directed Capacitated Arc Routing Problem Instances.	Recent Advances in Evolutionary Computation for Combinatorial Optimization	2008	DBLP DOI BibTeX RDF	Capacitated Arc Routing, Combinatorial Optimization, Garbage Collection, Metaheuristics, Data Perturbation, Problem Reduction
43	Thiago A. S. Masutti, Leandro Nunes de Castro	A Neuro-Immune Algorithm to Solve the Capacitated Vehicle Routing Problem.	ICARIS	2008	DBLP DOI BibTeX RDF	Capacitated Vehicle Routing Problem, Artificial Neural Networks, Combinatorial Optimization, Self-Organizing Maps, Artificial Immune Systems
43	Jingling Zhang, Yanwei Zhao, Dian-Jun Peng, Wanliang Wang	A Hybrid Quantum-Inspired Evolutionary Algorithm for Capacitated Vehicle Routing Problem.	ICIC (1)	2008	DBLP DOI BibTeX RDF	Quantum-Inspired Evolutionary Algorithm (QEA), 2-OPT, Hybrid Quantum-Inspired Evolutionary Algorithm (HQEA), Q-bit representation, Q-gate, capacitated vehicle routing problem
43	Lyamine Bouhafs, Amir Hajjam, Abderrafiaa Koukam	A Tabu Search and Ant Colony System Approach for the Capacitated Location-Routing Problem.	SNPD	2008	DBLP DOI BibTeX RDF	Capacitated Location-Routing problem, Optimization, Tabu Search, Ant Colony System
43	Zhipeng Cai 0001, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang 0001	An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem.	COCOA	2008	DBLP DOI BibTeX RDF	Capacitated Multicast Tree Routing, Approximation Algorithm, Tree Partitioning, Steiner Minimum Tree
43	Mohamed Haouari, Mehdi Mrad, Hanif D. Sherali	Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements.	Optim. Lett.	2007	DBLP DOI BibTeX RDF	Synthesis of capacitated networks, Network design, Benders decomposition
43	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
43	Samad Ahmadi, Ibrahim H. Osman	Density Based Problem Space Search for the Capacitated Clustering p-Median Problem.	Ann. Oper. Res.	2004	DBLP DOI BibTeX RDF	capacitated clustering (p-median) problem, greedy density search, guided construction search method, problem-space search, metaheuristics
43	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
43	Isabel Correia 0001, M. Eugénia V. Captivo	A Lagrangean Heuristic for a Modular Capacitated Location Problem.	Ann. Oper. Res.	2003	DBLP DOI BibTeX RDF	capacitated location, Lagrangean heuristic, mixed integer linear programming
43	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
43	V. T. Raja, Bernard T. Han	An Efficient Heuristic for Solving an Extended Capacitated Concentrator Location Problem.	Telecommun. Syst.	2003	DBLP DOI BibTeX RDF	local access network design, capacitated location problems, optimization, integer programming, mathematical modeling
43	Anita Amberg, Stefan Voß 0001	A Hierarchical Relaxations Lower Bound for the Capacitated Arc Routing Problem.	HICSS	2002	DBLP DOI BibTeX RDF	Capacitated arc routing problem, lower bounds, transportation, vehicle routing
42	Imdat Kara, Bahar Yetis Kara, M. Kadri Yetis	Energy Minimizing Vehicle Routing Problem.	COCOA	2007	DBLP DOI BibTeX RDF	Capacitated vehicle routing problem, Energy minimizing vehicle routing problem, Integer programming
42	Fred W. Glover, Hanif D. Sherali	Some Classes of Valid Inequalities and Convex Hull Characterizations for Dynamic Fixed-Charge Problems under Nested Constraints.	Ann. Oper. Res.	2005	DBLP DOI BibTeX RDF	dynamic fixed-charge problems, capacitated lot-sizing, convex hull, valid inequalities, reformulation-linearization technique
42	Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan	An Improved Approximation Algorithm for Vertex Cover with Hard Capacities.	ICALP	2003	DBLP DOI BibTeX RDF	capacitated covering, Approximation algorithms, linear programming, set cover, vertex cover, randomized rounding
42	Andrew J. Miller, George L. Nemhauser, Martin W. P. Savelsbergh	Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times.	IPCO	2001	DBLP DOI BibTeX RDF	capacitated lot-sizing, fixed charge network flow, Mixed integer programming, polyhedral combinatorics, production planning, setup times
34	Eduardo Uchoa, Ricardo Fukasawa, Jens Lysgaard, Artur Alves Pessoa, Marcus Poggi de Aragão, Diogo Andrade	Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (1991) 20E28, 20G40, 20C20
34	Tim Carnes, David B. Shmoys	Primal-Dual Schema for Capacitated Covering Problems.	IPCO	2008	DBLP DOI BibTeX RDF
34	Edna Ayako Hoshino, Cid C. de Souza	Column Generation Algorithms for the Capacitated m-Ring-Star Problem.	COCOON	2008	DBLP DOI BibTeX RDF
34	Fabrizio Marinelli 0001, Maria Elena Nenni, Antonio Sforza	Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company.	Ann. Oper. Res.	2007	DBLP DOI BibTeX RDF	Scheduling, Packaging, Lot sizing
34	Gábor Rétvári, József Bíró, Tibor Cinkler	Routing-Independent Fairness in Capacitated Networks.	ICC	2007	DBLP DOI BibTeX RDF
34	Crina Grosan, Ajith Abraham	Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach.	Asia International Conference on Modelling and Simulation	2007	DBLP DOI BibTeX RDF
34	Gyula Pap	Some new results on node-capacitated packing of A-paths.	STOC	2007	DBLP DOI BibTeX RDF	node-capacities, paths-packing, algorithms
34	Inmaculada Rodríguez Martín, Juan José Salazar González	An Iterated Local Search Heuristic for a Capacitated Hub Location Problem.	Hybrid Metaheuristics	2006	DBLP DOI BibTeX RDF
34	Raja Jothi, Balaji Raghavachari	Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design.	ACM Trans. Algorithms	2005	DBLP DOI BibTeX RDF	approximation algorithms, network design, Spanning trees, minimum spanning trees
34	Melquíades Pérez Pérez, Francisco Almeida, J. Marcos Moreno-Vega	A Hybrid GRASP-Path Relinking Algorithm for the Capacitated p-hub Median Problem.	Hybrid Metaheuristics	2005	DBLP DOI BibTeX RDF
34	Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton, Harald Räcke	Oblivious routing on node-capacitated and directed graphs.	SODA	2005	DBLP BibTeX RDF
34	Refael Hassin, R. Ravi 0001, F. Sibel Salman	Approximation Algorithms for a Capacitated Network Design Problem.	Algorithmica	2004	DBLP DOI BibTeX RDF	Routing flow, Capacity installation, Approximation algorithms, Network design
34	Raja Jothi, Balaji Raghavachari	Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design.	ICALP	2004	DBLP DOI BibTeX RDF
34	Inmaculada Rodríguez Martín, Juan José Salazar González	Decomposition Approaches for a Capacitated Hub Problem.	IBERAMIA	2004	DBLP DOI BibTeX RDF
34	Marko Loparic, Hugues Marchand, Laurence A. Wolsey	Dynamic knapsack sets and capacitated lot-sizing.	Math. Program.	2003	DBLP DOI BibTeX RDF
34	Jean Berger, Mohamed Barkaoui	A Hybrid Genetic Algorithm for the Capacitated Vehicle Routing Problem.	GECCO	2003	DBLP DOI BibTeX RDF
34	Mohammad Mahdian, Yingyu Ye, Jiawei Zhang 0006	A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
34	Harold N. Gabow, K. S. Manu	Packing Algorithms for Arborescences (and Spanning Trees) in Capacitated Graphs.	IPCO	1995	DBLP DOI BibTeX RDF
33	Hiroshi Hirai 0001	The maximum multiflow problems with bounded fractionality.	STOC	2010	DBLP DOI BibTeX RDF	metrics, polynomial time algorithms, multicommodity flows
33	Katerina Papadaki 0001, Vasilis Friderikos	Joint Routing and Gateway Selection in Wireless Mesh Networks.	WCNC	2008	DBLP DOI BibTeX RDF
33	Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasiviswanathan, Bhuvan Urgaonkar	Packing to angles and sectors.	SPAA	2007	DBLP DOI BibTeX RDF	geometric covering, approximation algorithms, directional antenna, bin packing
33	Baruch Awerbuch, Tripurari Singh	An Online Algorithm for the Dynamic Maximal Dense Tree Problem.	Algorithmica	2002	DBLP DOI BibTeX RDF	Dense tree, Multicast, Dynamic, Online algorithms
32	Stefan Voß 0001	Capacitated Minimum Spanning Trees.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Capacitated minimum spanning tree problem, Terminal layout problem, Resource-constrained minimum spanning tree problem, Combinatorial optimization, Telecommunication, Spanning tree
31	Bryant A. Julstrom	An evolutionary algorithm for some cases of the single-source constrained plant location problem.	GECCO	2008	DBLP DOI BibTeX RDF	plant location, warehouse location, evolutionary algorithm, facility location, capacitated, single-source, permutation coding
31	Philippe Lacomme, Christian Prins, Wahiba Ramdane-Chérif	Competitive Memetic Algorithms for Arc Routing Problems.	Ann. Oper. Res.	2004	DBLP DOI BibTeX RDF	Capacitated Arc Routing Problem, CARP, metaheuristic, memetic algorithm
31	Pankaj K. Agarwal, Cecilia Magdalena Procopiuc	Exact and Approximation Algorithms for Clustering.	Algorithmica	2002	DBLP DOI BibTeX RDF	k -Center clustering, Capacitated clustering, Approximation algorithms
24	Xujin Chen, Bo Chen 0002	Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design.	Algorithmica	2009	DBLP DOI BibTeX RDF	Soft capacity, Approximation algorithm, Network design, Facility location, Performance guarantee
24	Anita Amberg, Wolfgang Domschke, Stefan Voß 0001	Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees.	Eur. J. Oper. Res.	2000	DBLP DOI BibTeX RDF
23	MohammadHossein Bateni, MohammadTaghi Hajiaghayi	Assignment problem in content distribution networks: unsplittable hard-capacitated facility location.	SODA	2009	DBLP DOI BibTeX RDF
23	Siddharth Barman, Shuchi Chawla 0001	Packing multiway cuts in capacitated graphs.	SODA	2009	DBLP DOI BibTeX RDF
23	Matthew J. W. Morgan, Christine L. Mumford	A weight-coded genetic algorithm for the capacitated arc routing problem.	GECCO	2009	DBLP DOI BibTeX RDF	genetic algorithms, optimization, heuristics, transportation
23	Ruichun Yang, Zhen Wang, Dachuan Xu	A Cost-Sharing Method for the Soft-Capacitated Economic Lot-Sizing Game.	COCOA	2009	DBLP DOI BibTeX RDF	Economic lot-sizing game, cost-sharing method, cross- monotonic, approximate cost recovery
23	Shu-Hsien Liao 0001, Chia-Lin Hsieh	A Capacitated Inventory-Location Model: Formulation, Solution Approach and Preliminary Computational Results.	IEA/AIE	2009	DBLP DOI BibTeX RDF	Location-inventory distribution network system, Scenario analysis, Multiobjective evolutionary algorithm
23	Iván A. Contreras, Juan A. Díaz 0002	Scatter search for the single source capacitated facility location problem.	Ann. Oper. Res.	2008	DBLP DOI BibTeX RDF	Discrete location, Tabu search, GRASP, Scatter search
23	Nabil Absi	Models and methods for capacitated lot-sizing problems.	4OR	2008	DBLP DOI BibTeX RDF	MSC classification 90B30, 90C27, 90C57, 90C59, 90C11, 90C39
23	Daniel Quadt, Heinrich Kuhn	Capacitated lot-sizing with extensions: a review.	4OR	2008	DBLP DOI BibTeX RDF	MSC Classification (2000) 90B30, 90B35, 90C27, 90C90, 90C10, 90C59
23	Daya Ram Gaur, Ramesh Krishnamurti, Rajeev Kohli	The capacitated max k -cut problem.	Math. Program.	2008	DBLP DOI BibTeX RDF
23	Enrique Alba 0001, Bernabé Dorronsoro	A Hybrid Cellular Genetic Algorithm for the Capacitated Vehicle Routing Problem.	Engineering Evolutionary Intelligent Systems	2008	DBLP DOI BibTeX RDF
23	Antonio Augusto Chaves, Francisco de Assis Corrêa, Luiz Antonio Nogueira Lorena	Clustering Search Heuristic for the Capacitated p -Median Problem.	Innovations in Hybrid Intelligent Systems	2008	DBLP DOI BibTeX RDF	p-Median Problem, Hybrid heuristics, Clustering Search
23	Ángel M. Pérez-Bellido, Sancho Salcedo-Sanz, Emilio G. Ortíz-García, Antonio Portilla-Figueras, Maurizio Naldi	Solving the Delay-Constrained Capacitated Minimum Spanning Tree Problem Using a Dandelion-Encoded Evolutionary Algorithm.	SEAL	2008	DBLP DOI BibTeX RDF
23	Maxim A. Babenko, Alexander V. Karzanov	A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem.	ESA	2008	DBLP DOI BibTeX RDF
23	Asim Munawar, Mohamed Wahib, Masaharu Munetomo, Kiyoshi Akama	Solving Large Instances of Capacitated Vehicle Routing Problem over Cell BE.	HPCC	2008	DBLP DOI BibTeX RDF
23	Javier Faulin, Miquel Gilibert, Angel A. Juan, Xavier Vilajosana, Rubén Ruiz	SR-1: A simulation-based algorithm for the Capacitated Vehicle Routing Problem.	WSC	2008	DBLP DOI BibTeX RDF
23	Harry Venables, Alfredo Moscardini	Ant Based Heuristics for the Capacitated Fixed Charge Location Problem.	ANTS Conference	2008	DBLP DOI BibTeX RDF
23	Ehab Morsy, Hiroshi Nagamochi	Approximating the Generalized Capacitated Tree-Routing Problem.	COCOON	2008	DBLP DOI BibTeX RDF
23	Joana Dias, M. Eugénia V. Captivo, João C. N. Clímaco	Dynamic multi-level capacitated and uncapacitated location problems: an approach using primal-dual heuristics.	Oper. Res.	2007	DBLP DOI BibTeX RDF	hierarchical location problems - dynamic location, heuristics
23	Leah Epstein, Thomas Erlebach, Asaf Levin	Online Capacitated Interval Coloring.	ESCAPE	2007	DBLP DOI BibTeX RDF
23	Jun Han, Zhaohao Sun, Jinpeng Huai, Xian Li	An Efficient Node Partitioning Algorithm for the Capacitated Minimum Spanning Tree Problem.	ACIS-ICIS	2007	DBLP DOI BibTeX RDF	Partition, Branch and bound, Pruning, Search tree, Neighborhood search
23	Ehab Morsy, Hiroshi Nagamochi	Approximating Capacitated Tree-Routings in Networks.	TAMC	2007	DBLP DOI BibTeX RDF	Tree Cover, Approximation Algorithm, Graph Algorithm, Network Optimization, Routing Problems
23	Yuichi Nagata	Edge Assembly Crossover for the Capacitated Vehicle Routing Problem.	EvoCOP	2007	DBLP DOI BibTeX RDF
23	Mohamed Reghioui, Christian Prins, Nacima Labadi	GRASP with Path Relinking for the Capacitated Arc Routing Problem with Time Windows.	EvoWorkshops	2007	DBLP DOI BibTeX RDF	GRASP, path relinking, time windows, arc routing
23	Marek Kubiak, Przemyslaw Wesolek	Accelerating Local Search in a Memetic Algorithm for the Capacitated Vehicle Routing Problem.	EvoCOP	2007	DBLP DOI BibTeX RDF
23	Andreas Beham	Parallel Tabu Search and the Multiobjective Capacitated Vehicle Routing Problem with Soft Time Windows.	EUROCAST	2007	DBLP DOI BibTeX RDF
23	Justo Puerto	A New Formulation of the Capacitated Discrete Ordered Median Problems with 0, 1-Assignment.	OR	2007	DBLP DOI BibTeX RDF
23	Fabian Kuhn, Thomas Moscibroda	Distributed approximation of capacitated dominating sets.	SPAA	2007	DBLP DOI BibTeX RDF	distributed approximation, capacities, dominating sets, LP relaxation
23	John Sniezek, Lawrence Bodin	Using mixed integer programming for solving the capacitated arc routing problem with vehicle/site dependencies with an application to the routing of residential sanitation collection vehicles.	Ann. Oper. Res.	2006	DBLP DOI BibTeX RDF	Mixed integer programs, Heuristic methods
23	Christian Prins, Caroline Prodhon, Roberto Wolfler Calvo	Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking.	4OR	2006	DBLP DOI BibTeX RDF	MSC Classification 90B06
23	Ricardo Fukasawa, Humberto J. Longo, Jens Lysgaard, Marcus Poggi de Aragão, Marcelo L. Reis, Eduardo Uchoa, Renato Fonseca F. Werneck	Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem.	Math. Program.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 20E28, 20G40, 20C20
23	David F. Manlove, Colin T. S. Sng	Popular Matchings in the Capacitated House Allocation Problem.	ESA	2006	DBLP DOI BibTeX RDF
23	Yong-Jin Lee	Multimedia Traffic Distribution Using Capacitated Multicast Tree.	ICDCIT	2006	DBLP DOI BibTeX RDF
23	Deniz Özdemir, Enver Yücesan, Yale T. Herer	Multi-location transshipment problem with capacitated production and lost sales.	WSC	2006	DBLP DOI BibTeX RDF
23	X. Liu, J. Zhang	A Capacitated Production Planning with Outsourcing: A General Model and Its Algorithm.	ICIC (1)	2006	DBLP DOI BibTeX RDF