Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
67 | Hans L. Bodlaender, Daniel Lokshtanov, Eelko Penninkx |
Planar Capacitated Dominating Set Is W[1]-Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers, pp. 50-60, 2009, Springer, 978-3-642-11268-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
67 | Michael Dom, Daniel Lokshtanov, Saket Saurabh 0001, Yngve Villanger |
Capacitated Domination and Covering: A Parameterized Perspective. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings, pp. 78-90, 2008, Springer, 978-3-540-79722-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Reliab. ![In: IEEE Trans. Reliab. 56(3), pp. 474-487, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
56 | Mong-Jen Kao, Chung-Shou Liao |
Capacitated Domination Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings, pp. 256-267, 2007, Springer, 978-3-540-77118-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
55 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
Multicommodity flow, well-linked terminals, and routing problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 183-192, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(3), pp. 34:1-34:17, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Recent Advances in Evolutionary Computation for Combinatorial Optimization ![In: Recent Advances in Evolutionary Computation for Combinatorial Optimization, pp. 275-294, 2008, Springer, 978-3-540-70806-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (2) ![In: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence, 4th International Conference on Intelligent Computing, ICIC 2008, Shanghai, China, September 15-18, 2008, Proceedings, pp. 251-258, 2008, Springer, 978-3-540-85983-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(4), pp. 51, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 106(3), pp. 453-466, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings, pp. 136-145, 2005, Springer, 3-540-28061-8. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings, pp. 219-233, 2004, Springer, 3-540-22113-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCC ![In: Proceedings of the 14th IEEE Symposium on Computers and Communications (ISCC 2009), July 5-8, Sousse, Tunisia, pp. 461-467, 2009, IEEE Computer Society, 978-1-4244-4672-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
45 | Fehmi Tanrisever, Erhan Kutanoglu |
Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 159(1), pp. 5-24, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Job formation, Multi-order jobs, Scheduling, Dynamic programming, Batching |
45 | Caroline Prodhon |
Solving the capacitated location-routing problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 5(4), pp. 339-342, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings, pp. 454-468, 2007, Springer, 978-3-540-72791-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, pp. 335-346, 2007, Springer, 978-3-540-75519-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
45 | Luca Bertazzi, Maria Grazia Speranza |
Rounding Procedures for the Discrete Version of the Capacitated Economic Order Quantity Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 107(1-4), pp. 33-49, 2001. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 17(2), pp. 214-234, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EvoWorkshops ![In: Applications of Evolutionary Computing, EvoWorkshops 2009: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG, Tübingen, Germany, April 15-17, 2009. Proceedings, pp. 778-787, 2009, Springer, 978-3-642-01128-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 14(5), pp. 405-423, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Recent Advances in Evolutionary Computation for Combinatorial Optimization ![In: Recent Advances in Evolutionary Computation for Combinatorial Optimization, pp. 259-274, 2008, Springer, 978-3-540-70806-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICARIS ![In: Artificial Immune Systems, 7th International Conference, ICARIS 2008, Phuket, Thailand, August 10-13, 2008. Proceedings, pp. 210-219, 2008, Springer, 978-3-540-85071-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (1) ![In: Advanced Intelligent Computing Theories and Applications. With Aspects of Theoretical and Methodological Issues, 4th International Conference on Intelligent Computing, ICIC 2008, Shanghai, China, September 15-18, 2008, Proceedings, pp. 31-38, 2008, Springer, 978-3-540-87440-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SNPD ![In: Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2008, In conjunction with Second International Workshop on Advanced Internet Technology and Applications, August 6-8, 2008, Phuket, Thailand, pp. 46-50, 2008, IEEE Computer Society, 978-0-7695-3263-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008. Proceedings, pp. 286-295, 2008, Springer, 978-3-540-85096-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 1(4), pp. 341-354, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 131(1-4), pp. 109-133, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 131(1-4), pp. 21-43, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 10(5), pp. 525-545, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 122(1-4), pp. 141-161, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 122(1-4), pp. 193-217, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Telecommun. Syst. ![In: Telecommun. Syst. 23(1-2), pp. 171-199, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS ![In: 35th Hawaii International Conference on System Sciences (HICSS-35 2002), CD-ROM / Abstracts Proceedings, 7-10 January 2002, Big Island, HI, USA, pp. 83, 2002, IEEE Computer Society, 0-7695-1435-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, First International Conference, COCOA 2007, Xi'an, China, August 14-16, 2007, Proceedings, pp. 62-71, 2007, Springer, 978-3-540-73555-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 140(1), pp. 215-233, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings, pp. 164-175, 2003, Springer, 3-540-40493-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 318-332, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 112(2), pp. 443-472, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings, pp. 288-302, 2008, Springer, 978-3-540-68886-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
34 | Edna Ayako Hoshino, Cid C. de Souza |
Column Generation Algorithms for the Capacitated m-Ring-Star Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 14th Annual International Conference, COCOON 2008, Dalian, China, June 27-29, 2008, Proceedings, pp. 631-641, 2008, Springer, 978-3-540-69732-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 150(1), pp. 177-192, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICC ![In: Proceedings of IEEE International Conference on Communications, ICC 2007, Glasgow, Scotland, UK, 24-28 June 2007, pp. 6344-6349, 2007, IEEE. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
34 | Crina Grosan, Ajith Abraham |
Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asia International Conference on Modelling and Simulation ![In: First Asia International Conference on Modelling and Simulation, AMS 2007, Phuket, Thailand, March 27-30, 2007, pp. 427-433, 2007, IEEE Computer Society, 978-0-7695-2845-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
34 | Gyula Pap |
Some new results on node-capacitated packing of A-paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 599-604, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Hybrid Metaheuristics ![In: Hybrid Metaheuristics, Third International Workshop, HM 2006, Gran Canaria, Spain, October 13-15, 2006, Proceedings, pp. 70-81, 2006, Springer, 3-540-46384-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 1(2), pp. 265-282, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Hybrid Metaheuristics ![In: Hybrid Metaheuristics, Second International Workshop, HM 2005, Barcelona, Spain, August 29-30, 2005, Proceedings, pp. 142-153, 2005, Springer, 3-540-28535-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 782-790, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
34 | Refael Hassin, R. Ravi 0001, F. Sibel Salman |
Approximation Algorithms for a Capacitated Network Design Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 38(3), pp. 417-431, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings, pp. 805-818, 2004, Springer, 3-540-22849-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Inmaculada Rodríguez Martín, Juan José Salazar González |
Decomposition Approaches for a Capacitated Hub Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IBERAMIA ![In: Advances in Artificial Intelligence - IBERAMIA 2004, 9th Ibero-American Conference on AI, Puebla, Mexico, November 22-26, 2004, Proceedings, pp. 154-163, 2004, Springer, 3-540-23806-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
34 | Marko Loparic, Hugues Marchand, Laurence A. Wolsey |
Dynamic knapsack sets and capacitated lot-sizing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 95(1), pp. 53-69, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
34 | Jean Berger, Mohamed Barkaoui |
A Hybrid Genetic Algorithm for the Capacitated Vehicle Routing Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation - GECCO 2003, Genetic and Evolutionary Computation Conference, Chicago, IL, USA, July 12-16, 2003. Proceedings, Part I, pp. 646-656, 2003, Springer, 3-540-40602-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
34 | Mohammad Mahdian, Yingyu Ye, Jiawei Zhang 0006 |
A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM-APPROX ![In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings, pp. 129-140, 2003, Springer, 3-540-40770-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
34 | Harold N. Gabow, K. S. Manu |
Packing Algorithms for Arborescences (and Spanning Trees) in Capacitated Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 4th International IPCO Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings, pp. 388-402, 1995, Springer, 3-540-59408-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
33 | Hiroshi Hirai 0001 |
The maximum multiflow problems with bounded fractionality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 115-120, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WCNC ![In: WCNC 2008, IEEE Wireless Communications & Networking Conference, March 31 2008 - April 3 2008, Las Vegas, Nevada, USA, Conference Proceedings, pp. 2325-2330, 2008, IEEE, 978-1-4244-1997-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasiviswanathan, Bhuvan Urgaonkar |
Packing to angles and sectors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007, pp. 171-180, 2007, ACM, 978-1-59593-667-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 32(4), pp. 540-553, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Dense tree, Multicast, Dynamic, Online algorithms |
32 | Stefan Voß 0001 |
Capacitated Minimum Spanning Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 347-357, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2008, Proceedings, Atlanta, GA, USA, July 12-16, 2008, pp. 607-608, 2008, ACM, 978-1-60558-130-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 131(1-4), pp. 159-185, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 33(2), pp. 201-226, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 53(3), pp. 263-297, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 124(2), pp. 360-376, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
23 | MohammadHossein Bateni, MohammadTaghi Hajiaghayi |
Assignment problem in content distribution networks: unsplittable hard-capacitated facility location. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 805-814, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Siddharth Barman, Shuchi Chawla 0001 |
Packing multiway cuts in capacitated graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 1048-1057, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Matthew J. W. Morgan, Christine L. Mumford |
A weight-coded genetic algorithm for the capacitated arc routing problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2009, Proceedings, Montreal, Québec, Canada, July 8-12, 2009, pp. 325-332, 2009, ACM, 978-1-60558-325-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009. Proceedings, pp. 166-173, 2009, Springer, 978-3-642-02025-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEA/AIE ![In: Next-Generation Applied Intelligence, 22nd International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2009, Tainan, Taiwan, June 24-27, 2009. Proceedings, pp. 323-332, 2009, Springer, 978-3-642-02567-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 157(1), pp. 73-89, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Discrete location, Tabu search, GRASP, Scatter search |
23 | Nabil Absi |
Models and methods for capacitated lot-sizing problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 6(3), pp. 311-314, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 6(1), pp. 61-83, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 115(1), pp. 65-72, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Enrique Alba 0001, Bernabé Dorronsoro |
A Hybrid Cellular Genetic Algorithm for the Capacitated Vehicle Routing Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Engineering Evolutionary Intelligent Systems ![In: Engineering Evolutionary Intelligent Systems, pp. 379-422, 2008, Springer, 978-3-540-75395-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Innovations in Hybrid Intelligent Systems ![In: Innovations in Hybrid Intelligent Systems, pp. 136-143, 2008, Springer, 978-3-540-74971-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SEAL ![In: Simulated Evolution and Learning, 7th International Conference, SEAL 2008, Melbourne, Australia, December 7-10, 2008. Proceedings, pp. 151-160, 2008, Springer, 978-3-540-89693-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Maxim A. Babenko, Alexander V. Karzanov |
A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings, pp. 124-135, 2008, Springer, 978-3-540-87743-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPCC ![In: 10th IEEE International Conference on High Performance Computing and Communications, HPCC 2008, 25-27 Sept. 2008, Dalian, China, pp. 131-138, 2008, IEEE Computer Society, 978-0-7695-3352-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WSC ![In: Proceedings of the 2008 Winter Simulation Conference, Global Gateway to Discovery, WSC 2008, InterContinental Hotel, Miami, Florida, USA, December 7-10, 2008, pp. 2708-2716, 2008, WSC, 978-1-4244-2708-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Harry Venables, Alfredo Moscardini |
Ant Based Heuristics for the Capacitated Fixed Charge Location Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANTS Conference ![In: Ant Colony Optimization and Swarm Intelligence, 6th International Conference, ANTS 2008, Brussels, Belgium, September 22-24, 2008. Proceedings, pp. 235-242, 2008, Springer, 978-3-540-87526-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Ehab Morsy, Hiroshi Nagamochi |
Approximating the Generalized Capacitated Tree-Routing Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 14th Annual International Conference, COCOON 2008, Dalian, China, June 27-29, 2008, Proceedings, pp. 621-630, 2008, Springer, 978-3-540-69732-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. ![In: Oper. Res. 7(3), pp. 345-379, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
hierarchical location problems - dynamic location, heuristics |
23 | Leah Epstein, Thomas Erlebach, Asaf Levin |
Online Capacitated Interval Coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESCAPE ![In: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers, pp. 243-254, 2007, Springer, 978-3-540-74449-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACIS-ICIS ![In: 6th Annual IEEE/ACIS International Conference on Computer and Information Science (ICIS 2007), 11-13 July 2007, Melbourne, Australia, pp. 575-580, 2007, IEEE Computer Society, 0-7695-2841-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings, pp. 342-353, 2007, Springer, 978-3-540-72503-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EvoCOP ![In: Evolutionary Computation in Combinatorial Optimization, 7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007, Proceedings, pp. 142-153, 2007, Springer, 978-3-540-71614-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EvoWorkshops ![In: Applications of Evolutinary Computing, EvoWorkshops 2007: EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog, Valencia, Spain, April11-13, 2007, Proceedings., pp. 722-731, 2007, Springer, 978-3-540-71804-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EvoCOP ![In: Evolutionary Computation in Combinatorial Optimization, 7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007, Proceedings, pp. 96-107, 2007, Springer, 978-3-540-71614-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Andreas Beham |
Parallel Tabu Search and the Multiobjective Capacitated Vehicle Routing Problem with Soft Time Windows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCAST ![In: Computer Aided Systems Theory - EUROCAST 2007, 11th International Conference on Computer Aided Systems Theory, Las Palmas de Gran Canaria, Spain, February 12-16, 2007, Revised Selected Papers, pp. 829-836, 2007, Springer, 978-3-540-75866-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Justo Puerto |
A New Formulation of the Capacitated Discrete Ordered Median Problems with 0, 1-Assignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OR ![In: Operations Research, Proceedings 2007, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Saarbrücken, Germany, September 5-7, 2007, pp. 165-170, 2007, Springer, 978-3-540-77902-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | Fabian Kuhn, Thomas Moscibroda |
Distributed approximation of capacitated dominating sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007, pp. 161-170, 2007, ACM, 978-1-59593-667-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 144(1), pp. 33-58, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 4(3), pp. 221-238, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 106(3), pp. 491-511, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings, pp. 492-503, 2006, Springer, 3-540-38875-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Yong-Jin Lee |
Multimedia Traffic Distribution Using Capacitated Multicast Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCIT ![In: Distributed Computing and Internet Technology, Third International Conference, ICDCIT 2006, Bhubaneswar, India, December 20-23, 2006, Proceedings, pp. 212-220, 2006, Springer, 3-540-68379-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Deniz Özdemir, Enver Yücesan, Yale T. Herer |
Multi-location transshipment problem with capacitated production and lost sales. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WSC ![In: Proceedings of the Winter Simulation Conference WSC 2006, Monterey, California, USA, December 3-6, 2006, pp. 1470-1476, 2006, IEEE Computer Society, 1-4244-0501-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | X. Liu, J. Zhang |
A Capacitated Production Planning with Outsourcing: A General Model and Its Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (1) ![In: Intelligent Computing, International Conference on Intelligent Computing, ICIC 2006, Kunming, China, August 16-19, 2006. Proceedings, Part I, pp. 997-1002, 2006, Springer, 3-540-37271-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|