Search results for "prize-collecting"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
131	Shai Gutner	Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems.	COCOA	2008	DBLP DOI BibTeX RDF	prize collecting Steiner tree problem, Approximation algorithms, primal-dual, local ratio
105	Mohammad Taghi Hajiaghayi, Kamal Jain	The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema.	SODA	2006	DBLP DOI BibTeX RDF
93	Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti	An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem.	Math. Program.	2006	DBLP DOI BibTeX RDF	Steiner Arborescence, Prize Collecting, Network Design, Branch-and-Cut
80	Antonio Augusto Chaves, Luiz Antonio Nogueira Lorena	Hybrid Algorithms with Detection of Promising Areas for the Prize Collecting Travelling Salesman Problem.	HIS	2005	DBLP DOI BibTeX RDF
74	Antonio Augusto Chaves, Luiz Antonio Nogueira Lorena	Hybrid Metaheuristic for the Prize Collecting Travelling Salesman Problem.	EvoCOP	2008	DBLP DOI BibTeX RDF
74	Aaron Archer, MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Howard J. Karloff	Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP.	FOCS	2009	DBLP DOI BibTeX RDF	prize-collecting, stroll, path-TSP, approximation algorithm, traveling salesman problem, Steiner tree
67	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
67	Yogeshwer Sharma, Chaitanya Swamy, David P. Williamson	Approximation algorithms for prize collecting forest problems with submodular penalty functions.	SODA	2007	DBLP BibTeX RDF
64	Roberto Cordone, Marco Trubian	An exact algorithm for the node weighted Steiner tree problem.	4OR	2006	DBLP DOI BibTeX RDF	Prize collecting, Relax-and-cut, Steiner problem
64	Baruch Awerbuch, Yossi Azar	Buy-at-Bulk Network Design.	FOCS	1997	DBLP DOI BibTeX RDF	buy-at-bulk network design, central network switch, multi-sink network design, selective network design, Generalized Steiner Connectivity, Prize-collecting salesman, K-MST, connectivity, network routing, network capacity
58	Wei Liang, Zhao Zhang 0002	Approximation Algorithm for Unrooted Prize-Collecting Forest with Multiple Components and Its Application on Prize-Collecting Sweep Coverage.	CoRR	2023	DBLP DOI BibTeX RDF
48	Bruce L. Golden, S. Raghavan 0001, Daliborka Stanojevic	The prize-collecting generalized minimum spanning tree problem.	J. Heuristics	2008	DBLP DOI BibTeX RDF	Genetic algorithms, Networks, Heuristics, Local search, Branch-and-cut
48	Petrica C. Pop	On the prize-collecting generalized minimum spanning tree problem.	Ann. Oper. Res.	2007	DBLP DOI BibTeX RDF	Generalized minimum spanning tree problem, Combinatorial optimization, Minimum spanning trees, Linear relaxation
48	Anupam Gupta 0001, Jochen Könemann, Stefano Leonardi 0001, R. Ravi 0001, Guido Schäfer	An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem.	SODA	2007	DBLP BibTeX RDF
48	Markus Chimani, Maria Kandyba, Petra Mutzel	A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks.	ESA	2007	DBLP DOI BibTeX RDF
48	Yanyan Zhang, Lixin Tang	Solving Prize-Collecting Traveling Salesman Problem with Time Windows by Chaotic Neural Network.	ISNN (2)	2007	DBLP DOI BibTeX RDF
48	Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra Mutzel, Philipp Neuner, Ulrich Pferschy, Günther R. Raidl, René Weiskircher	Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem.	GECCO (1)	2004	DBLP DOI BibTeX RDF
48	Per Olov Lindberg, Gholamreza Razmara	The Prize Collecting Connected Subgraph Problem - A New NP-Hard Problem arising in Snow Removal Routing.	OR	2004	DBLP DOI BibTeX RDF
48	Reuven Bar-Yehuda, Guy Even, Shimon Shahar	On Approximating a Geometric Prize-Collecting Traveling Salesman Problem with Time Windows: Extended Abstract.	ESA	2003	DBLP DOI BibTeX RDF
48	Gunnar W. Klau, Ivana Ljubic, Petra Mutzel, Ulrich Pferschy, René Weiskircher	The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract.	ESA	2003	DBLP DOI BibTeX RDF
45	Andréa C. Santos 0001, Christophe Duhamel, Dario J. Aloise	Modeling the Mobile Oil Recovery Problem as a Multiobjective Vehicle Routing Problem.	MCO	2008	DBLP DOI BibTeX RDF	prize-collecting, Vehicle routing problem, multiobjective
38	Jochen Könemann, Ojas Parekh, Danny Segev	A Unified Approach to Approximating Partial Covering Problems.	ESA	2006	DBLP DOI BibTeX RDF
38	Anna Moss, Yuval Rabani	Approximation algorithms for constrained for constrained node weighted steiner tree problems.	STOC	2001	DBLP DOI BibTeX RDF
29	Natanael Ramos, Rafael G. Cano, Pedro J. de Rezende, Cid C. de Souza	Exact and heuristic solutions for the prize-collecting geometric enclosure problem.	Int. Trans. Oper. Res.	2024	DBLP DOI BibTeX RDF
29	Wei Liang, Zhao Zhang 0002, Ding-Zhu Du	A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems.	Optim. Lett.	2024	DBLP DOI BibTeX RDF
29	Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi	2-Approximation for Prize-Collecting Steiner Forest.	SODA	2024	DBLP DOI BibTeX RDF
29	Luana Souza Almeida, Alireza Ghasemi, Floris Goerlandt	E-ARCP: An exact solution approach to the Collaborative Multi-vehicle Prize Collecting Arc Routing for Connectivity Problem.	SoftwareX	2023	DBLP DOI BibTeX RDF
29	Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi	2-Approximation for Prize-Collecting Steiner Forest.	CoRR	2023	DBLP DOI BibTeX RDF
29	Jannis Blauth, Nathan Klein, Martin Nägele	A Better-Than-1.6-Approximation for Prize-Collecting TSP.	CoRR	2023	DBLP DOI BibTeX RDF
29	Aurélien Froger, Ruslan Sadykov	New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources.	Eur. J. Oper. Res.	2023	DBLP DOI BibTeX RDF
29	Xiaofei Liu, Weidong Li, Jinhua Yang	A primal-dual approximation algorithm for the k-prize-collecting minimum vertex cover problem with submodular penalties.	Frontiers Comput. Sci.	2023	DBLP DOI BibTeX RDF
29	Justin Ruiz, Christopher Gonzalez, Yutian Chen, Bin Tang	Prize-Collecting Traveling Salesman Problem: A Reinforcement Learning Approach.	ICC	2023	DBLP DOI BibTeX RDF
29	Jannis Blauth, Martin Nägele	An Improved Approximation Guarantee for Prize-Collecting TSP.	STOC	2023	DBLP DOI BibTeX RDF
29	Daniel Rehfeldt, Thorsten Koch	On the Exact Solution of Prize-Collecting Steiner Tree Problems.	INFORMS J. Comput.	2022	DBLP DOI BibTeX RDF
29	Nicola Morandi, Roel Leus, Hande Yaman	Exact algorithms for budgeted prize-collecting covering subgraph problems.	Comput. Oper. Res.	2022	DBLP DOI BibTeX RDF
29	Luana Souza Almeida, Floris Goerlandt, Ronald Pelot, Kenneth Sörensen	A Greedy Randomized Adaptive Search Procedure (GRASP) for the multi-vehicle prize collecting arc routing for connectivity problem.	Comput. Oper. Res.	2022	DBLP DOI BibTeX RDF
29	Guido Pantuza Jr., Maurício C. de Souza	Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem.	Int. Trans. Oper. Res.	2022	DBLP DOI BibTeX RDF
29	David Whittle, Marcus Brazil, Peter Alexander Grossman, J. Hyam Rubinstein, Doreen A. Thomas	Solving the prize-collecting Euclidean Steiner tree problem.	Int. Trans. Oper. Res.	2022	DBLP DOI BibTeX RDF
29	Shao-Wu Zhang, Zhen-Nan Wang, Yan Li, Weifeng Guo	Prioritization of cancer driver gene with prize-collecting steiner tree by introducing an edge weighted strategy in the personalized gene interaction network.	BMC Bioinform.	2022	DBLP DOI BibTeX RDF
29	Xiaofei Liu, Weidong Li, Runtao Xie	A primal-dual approximation algorithm for the k-prize-collecting minimum power cover problem.	Optim. Lett.	2022	DBLP DOI BibTeX RDF
29	Lehilton Lelis Chaves Pedrosa, Hugo Kooki Kasuya Rosado	A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem.	Algorithmica	2022	DBLP DOI BibTeX RDF
29	Wei Liang, Zhao Zhang 0002	Approximation algorithm for prize-collecting sweep cover with base stations.	Theor. Comput. Sci.	2022	DBLP DOI BibTeX RDF
29	Yotaro Takazawa	Approximation algorithm for the stochastic prize-collecting set multicover problem.	Oper. Res. Lett.	2022	DBLP DOI BibTeX RDF
29	Judith Bernett, Dominik Krupke, Sepideh Sadegh, Jan Baumbach, Sándor P. Fekete, Tim Kacprowski, Markus List, David B. Blumenthal	Robust disease module mining via enumeration of diverse prize-collecting Steiner trees.	Bioinform.	2022	DBLP DOI BibTeX RDF
29	Rajni Dabas, Neelima Gupta	Locating Charging Stations: Connected, Capacitated and Prize- Collecting.	CoRR	2022	DBLP BibTeX RDF
29	Jannis Blauth, Martin Nägele	An improved approximation guarantee for Prize-Collecting TSP.	CoRR	2022	DBLP DOI BibTeX RDF
29	Jiaxuan Zhang, Suogang Gao, Bo Hou, Wen Liu 0009	An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties.	Comput. Appl. Math.	2022	DBLP DOI BibTeX RDF
29	Timothy Murray, Jugal Garg, Rakesh Nagi	Prize Collecting Multiagent Orienteering: Price of Anarchy Bounds and Solution Methods.	IEEE Trans Autom. Sci. Eng.	2022	DBLP DOI BibTeX RDF
29	Sina Dezfuli, Zachary Friggstad, Ian Post, Chaitanya Swamy	Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems.	IPCO	2022	DBLP DOI BibTeX RDF
29	Xiaofei Liu, Weidong Li	An Approximation Algorithm for the B-prize-collecting Multicut Problem in Trees.	TAMC	2022	DBLP DOI BibTeX RDF
29	Ruiqing Sun, Bin Deng	W-prize-collecting scheduling problem on a single machine.	CSAI	2022	DBLP DOI BibTeX RDF
29	Lu Han, Vincent Chau, Chi Kit Ken Fong	Approximation Algorithms for Prize-Collecting Capacitated Network Design Problems.	FAW	2022	DBLP DOI BibTeX RDF
29	Han Dai, Weidong Li 0002, Xiaofei Liu	An Approximation Algorithm for the H-Prize-Collecting Power Cover Problem.	FAW	2022	DBLP DOI BibTeX RDF
29	Mikhail Yu. Khachay, Katherine Neznakhina, Ksenia Rizhenko	Prize-Collecting Asymmetric Traveling Salesman Problem Admits Polynomial Time Approximation Within a Constant Ratio.	OPTIMA	2022	DBLP DOI BibTeX RDF
29	Bibek Bhattarai, H. Howie Huang	SteinerLog: Prize Collecting the Audit Logs for Threat Hunting on Enterprise Network.	AsiaCCS	2022	DBLP DOI BibTeX RDF
29	Bo Hou, Zhenzhen Pang, Suogang Gao, Wen Liu 0009	Improved Approximation Algorithm for the Asymmetric Prize-Collecting TSP.	AAIM	2022	DBLP DOI BibTeX RDF
29	Johannes Maschler, Günther R. Raidl	Multivalued decision diagrams for prize-collecting job sequencing with one common and multiple secondary resources.	Ann. Oper. Res.	2021	DBLP DOI BibTeX RDF
29	Matthias Horn, Günther R. Raidl, Elina Rönnberg	A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources.	Ann. Oper. Res.	2021	DBLP DOI BibTeX RDF
29	Glaubos Clímaco, Isabel Rosseti, Rogérioda Silva, Marcos A. Guerine	Reactive GRASP for the Prize-collecting Covering Tour Problem.	RAIRO Oper. Res.	2021	DBLP DOI BibTeX RDF
29	Glaubos Clímaco, Luidi Simonetti, Isabel Rosseti	A Branch-and-Cut and MIP-based heuristics for the Prize-Collecting Travelling Salesman Problem.	RAIRO Oper. Res.	2021	DBLP DOI BibTeX RDF
29	Vahid Riahi, M. A. Hakim Newton, Abdul Sattar 0001	A scatter search algorithm for time-dependent prize-collecting arc routing problems.	Comput. Oper. Res.	2021	DBLP DOI BibTeX RDF
29	Matthias Horn, Johannes Maschler, Günther R. Raidl, Elina Rönnberg	A∗-based construction of decision diagrams for a prize-collecting scheduling problem.	Comput. Oper. Res.	2021	DBLP DOI BibTeX RDF
29	Carlos Contreras Bolton, Víctor Parada	An effective two-level solution approach for the prize-collecting generalized minimum spanning tree problem by iterated local search.	Int. Trans. Oper. Res.	2021	DBLP DOI BibTeX RDF
29	Zhen Zhang 0025, Yutian Guo, Junyu Huang, Jianxin Wang 0001, Feng Shi 0003	Improved approximation for prize-collecting red-blue median.	Theor. Comput. Sci.	2021	DBLP DOI BibTeX RDF
29	Sina Dezfuli, Zachary Friggstad, Ian Post, Chaitanya Swamy	Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems.	CoRR	2021	DBLP BibTeX RDF
29	Parikshit Saikia, Sushanta Karmakar, Aris Pagourtzis	Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree.	Discret. Math. Algorithms Appl.	2021	DBLP DOI BibTeX RDF
29	Wei Liang, Zhao Zhang 0002	Constant-Approximation for Prize-Collecting Min-Sensor Sweep Coverage with Base Stations.	AAIM	2021	DBLP DOI BibTeX RDF
29	Christine Markarian, Abdul Nasser El-Kassar	Algorithmic View of Online Prize-collecting Optimization Problems.	ICEIS (1)	2021	DBLP DOI BibTeX RDF
29	Christine Markarian, Abdul Nasser El-Kassar	Online Algorithms for Prize-Collecting Optimization Problems.	ICEIS (Revised Selected Papers)	2021	DBLP DOI BibTeX RDF
29	Ygor Alcântara de Medeiros, Marco César Goldbarg, Elizabeth Ferreira Gouvea Goldbarg	Prize Collecting Traveling Salesman Problem with Ridesharing.	RITA	2020	DBLP DOI BibTeX RDF
29	T.-H. Hubert Chan, Haotian Jiang, Shaofeng H.-C. Jiang	A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics.	ACM Trans. Algorithms	2020	DBLP DOI BibTeX RDF
29	Ruslán G. Marzo, Celso C. Ribeiro	A GRASP with path-relinking and restarts heuristic for the prize-collecting generalized minimum spanning tree problem.	Int. Trans. Oper. Res.	2020	DBLP DOI BibTeX RDF
29	Xin Hou, Wen Liu 0009, Bo Hou	An approximation algorithm for the k-prize-collecting multicut on a tree problem.	Theor. Comput. Sci.	2020	DBLP DOI BibTeX RDF
29	Dimitra Trachanatzi, Manousos Rigakis, Magdalene Marinaki, Yannis Marinakis	A firefly algorithm for the environmental prize-collecting vehicle routing problem.	Swarm Evol. Comput.	2020	DBLP DOI BibTeX RDF
29	Alice Paul, Daniel Freund 0001, Aaron M. Ferber, David B. Shmoys, David P. Williamson	Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems.	Math. Oper. Res.	2020	DBLP DOI BibTeX RDF
29	Zhen Zhang 0025, Yutian Guo, Junyu Huang	An Improved Approximation Algorithm for the Prize-Collecting Red-Blue Median Problem.	TAMC	2020	DBLP DOI BibTeX RDF
29	Lehilton L. C. Pedrosa, Hugo K. K. Rosado	A 2-Approximation for the k-Prize-Collecting Steiner Tree Problem.	LATIN	2020	DBLP DOI BibTeX RDF
29	Lu Han, Changjun Wang, Dachuan Xu, Dongmei Zhang 0002	The Prize-Collecting k-Steiner Tree Problem.	PDCAT	2020	DBLP DOI BibTeX RDF
29	Jianyu Long, Zhenzhong Sun, Panos M. Pardalos, Ying Hong, Shaohui Zhang, Chuan Li 0003	A hybrid multi-objective genetic local search algorithm for the prize-collecting vehicle routing problem.	Inf. Sci.	2019	DBLP DOI BibTeX RDF
29	Yusa Matsuda, Satoshi Takahashi	A 4-approximation algorithm for k-prize collecting Steiner tree problems.	Optim. Lett.	2019	DBLP DOI BibTeX RDF
29	Lu Han, Dachuan Xu, Donglei Du, Chenchen Wu	A 5-approximation algorithm for the k-prize-collecting Steiner tree problem.	Optim. Lett.	2019	DBLP DOI BibTeX RDF
29	Lehilton Lelis Chaves Pedrosa, Hugo Kooki Kasuya Rosado	A 2-approximation for the k-prize-collecting Steiner tree problem.	CoRR	2019	DBLP BibTeX RDF
29	Daniel Rehfeldt, Thorsten Koch, Stephen J. Maher	Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem.	Networks	2019	DBLP DOI BibTeX RDF
29	Stefan Edelkamp, Erion Plaku, Yassin Warsame	Monte-Carlo Search for Prize-Collecting Robot Motion Planning with Time Windows, Capacities, Pickups, and Deliveries.	KI	2019	DBLP DOI BibTeX RDF
29	Elizabeth Montero, Dario Canales, Germán Paredes-Belmar, Raúl Soto	A Prize Collecting problem applied to a Real Milk Collection problem in Chile.	CEC	2019	DBLP DOI BibTeX RDF
29	Edward Kh. Gimadi, Oxana Yu. Tsidulko	Asymptotically Optimal Algorithms for the Prize-Collecting Traveling Salesman Problem on Random Inputs.	LION	2019	DBLP DOI BibTeX RDF
29	Jian Sun 0022, Haiyun Sheng, Yuefang Sun, Xiaoyan Zhang 0001	Approximation Algorithm for Stochastic Prize-Collecting Steiner Tree Problem.	AAIM	2019	DBLP DOI BibTeX RDF
29	Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl	A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems.	INFORMS J. Comput.	2018	DBLP DOI BibTeX RDF
29	Roberto Cordone, Pierre Hosteins, Giovanni Righini	A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization.	INFORMS J. Comput.	2018	DBLP DOI BibTeX RDF
29	Daniel Porumbel	Prize-collecting set multicovering with submodular pricing.	Int. Trans. Oper. Res.	2018	DBLP DOI BibTeX RDF
29	Jiawei Qian, Seeun William Umboh, David P. Williamson	Online Constrained Forest and Prize-Collecting Network Design.	Algorithmica	2018	DBLP DOI BibTeX RDF
29	Yusa Matsuda, Satoshi Takahashi	A 4-Approximation Algorithm for k-Prize Collecting Steiner Tree Problems.	CoRR	2018	DBLP BibTeX RDF
29	Giorgio Ausiello, Vincenzo Bonifaci, Stefano Leonardi 0001, Alberto Marchetti-Spaccamela	Prize Collecting Traveling Salesman and Related Problems.	Handbook of Approximation Algorithms and Metaheuristics (1)	2018	DBLP DOI BibTeX RDF
29	T.-H. Hubert Chan, Haotian Jiang, Shaofeng H.-C. Jiang	A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics.	ESA	2018	DBLP DOI BibTeX RDF
29	Yi-Fei Ming, Si-Bo Chen, Yong-Quan Chen, Zhang-Hua Fu	A Fast Vertex-Swap Operator for the Prize-Collecting Steiner Tree Problem.	ICCS (2)	2018	DBLP DOI BibTeX RDF
29	Christine Markarian	An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest.	IWOCA	2018	DBLP DOI BibTeX RDF
29	Yahui Sun 0001	Classical, prize-collecting and node-weighted Steiner tree problems in graphs.		2018	RDF
29	Vahid Akbari 0002, F. Sibel Salman	Multi-vehicle prize collecting arc routing for connectivity problem.	Comput. Oper. Res.	2017	DBLP DOI BibTeX RDF
29	Takuro Fukunaga	Spider Covers for Prize-Collecting Network Activation Problem.	ACM Trans. Algorithms	2017	DBLP DOI BibTeX RDF
29	Parikshit Saikia, Sushanta Karmakar	A Primal-Dual based Distributed Approximation Algorithm for Prize Collecting Steiner Tree.	CoRR	2017	DBLP BibTeX RDF