Search results for "dual-ascent"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
78	Tobias Polzin, Siavash Vahdati Daneshmand	Primal-dual approaches to the Steiner problem.	APPROX	2000	DBLP DOI BibTeX RDF	dual-ascent, approximation algorithms, lower bound, relaxation, primal-dual, Steiner problem
65	Jaroslav Janácek, Lubos Buzna	An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem.	Ann. Oper. Res.	2008	DBLP DOI BibTeX RDF	Uncapacitated facility location problem, Dual ascent algorithm, DualLoc, PDLoc, Branch and bound
44	Adriana Felicia Bumb, Walter Kern	A Simple Dual Ascent Algorithm for the Multilevel Facility Location Problem.	RANDOM-APPROX	2001	DBLP DOI BibTeX RDF
34	Kaj Holmberg	Facility Location Problems with Spatial Interaction.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Dual ascent, Integer programming, Location, Spatial interaction
30	Roberto Baldacci, Nicos Christofides, Aristide Mingozzi	An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C27, 90C39, 49M29
27	Archis Ghate	Dual Ascent and Primal-Dual Algorithms for Infinite-Horizon Nonstationary Markov Decision Processes.	SIAM J. Optim.	2023	DBLP DOI BibTeX RDF
22	Paula Stocco, Suhas Chundi, Arec L. Jamgochian, Mykel J. Kochenderfer	Addressing Myopic Constrained POMDP Planning with Recursive Dual Ascent.	CoRR	2024	DBLP DOI BibTeX RDF
22	Changsen Feng, Bomiao Liang, Zhengmao Li, Weijia Liu, Fushuan Wen	Peer-to-Peer Energy Trading Under Network Constraints Based on Generalized Fast Dual Ascent.	IEEE Trans. Smart Grid	2023	DBLP DOI BibTeX RDF
22	Samhita Vadrevu, Rakesh Nagi	A GPU Accelerated Dual-Ascent Algorithm for the Multidimensional Assignment Problem in a Multitarget Tracking Application.	IEEE Trans Autom. Sci. Eng.	2023	DBLP DOI BibTeX RDF
22	Arec L. Jamgochian, Anthony Corso 0001, Mykel J. Kochenderfer	Online Planning for Constrained POMDPs with Continuous Spaces through Dual Ascent.	ICAPS	2023	DBLP DOI BibTeX RDF
22	Mattia Bianchi, Wicak Ananduta, Sergio Grammatico	The Distributed Dual Ascent Algorithm is Robust to Asynchrony.	IEEE Control. Syst. Lett.	2022	DBLP DOI BibTeX RDF
22	Arec L. Jamgochian, Anthony Corso 0001, Mykel J. Kochenderfer	Online Planning for Constrained POMDPs with Continuous Spaces through Dual Ascent.	CoRR	2022	DBLP DOI BibTeX RDF
22	Alex Shtoff, Yair Koren	Mitigating Divergence of Latent Factors via Dual Ascent for Low Latency Event Prediction Models.	CoRR	2021	DBLP BibTeX RDF
22	Mattia Bianchi, Wicak Ananduta, Sergio Grammatico	The distributed dual ascent algorithm is robust to asynchrony.	CoRR	2021	DBLP BibTeX RDF
22	Alex Shtoff, Yair Koren	Mitigating Divergence of Latent Factors via Dual Ascent for Low Latency Event Prediction Models.	IEEE BigData	2021	DBLP DOI BibTeX RDF
22	Yuwen Cao, Tomoaki Ohtsuki, Tony Q. S. Quek	Dual-Ascent Inspired Transmit Precoding for Evolving Multiple-Access Spatial Modulation.	IEEE Trans. Commun.	2020	DBLP DOI BibTeX RDF
22	Samhita Vadrevu, Rakesh Nagi	A Dual- Ascent Algorithm for the Multi-dimensional Assignment Problem: Application to Multi-Target Tracking.	FUSION	2020	DBLP DOI BibTeX RDF
22	Stefania Pan, Roberto Wolfler Calvo, Mahuna Akplogan, Lucas Létocart, Nora Touati Moungla	A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints.	Discret. Optim.	2019	DBLP DOI BibTeX RDF
22	Yuwen Cao, Tomoaki Ohtsuki	Dual-Ascent Inspired Iterative Transmit Precoding Approaches for Multiple Access Spatial Modulation.	GLOBECOM	2019	DBLP DOI BibTeX RDF
22	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
22	Telmo Matos, Fábio Maia, Dorabela Gamboa	Improving Traditional Dual Ascent Algorithm for the Uncapacitated Multiple Allocation Hub Location Problem: A RAMP Approach.	LOD	2018	DBLP DOI BibTeX RDF
22	Andrea Simonetto	Prediction-Correction Dual Ascent for Time-Varying Convex Programs.	ACC	2018	DBLP DOI BibTeX RDF
22	Kasim Sinan Yildirim, Ruggero Carli, Luca Schenato 0001, Marco Todescato	A distributed dual-ascent approach for power control of wireless power transfer networks.	CDC	2017	DBLP DOI BibTeX RDF
22	Paul Swoboda, Carsten Rother, Hassan Abu Alhaija, Dagmar Kainmüller, Bogdan Savchynskyy	A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching.	CVPR	2017	DBLP DOI BibTeX RDF
22	Paul Swoboda, Jan Kuske, Bogdan Savchynskyy	A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems.	CVPR	2017	DBLP DOI BibTeX RDF
22	Kurt Jörnsten, Andreas Klose	An improved Lagrangian relaxation and dual ascent approach to facility location problems.	Comput. Manag. Sci.	2016	DBLP DOI BibTeX RDF
22	Paul Swoboda, Jan Kuske, Bogdan Savchynskyy	A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems.	CoRR	2016	DBLP BibTeX RDF
22	Paul Swoboda, Carsten Rother, Hassan Abu Alhaija, Dagmar Kainmueller, Bogdan Savchynskyy	A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching.	CoRR	2016	DBLP BibTeX RDF
22	Ruben Becker, Maximilian Fickert, Andreas Karrenbauer	A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem.	ALENEX	2016	DBLP DOI BibTeX RDF
22	Robert Mansel Gower, Peter Richtárik	Stochastic Dual Ascent for Solving Linear Systems.	CoRR	2015	DBLP BibTeX RDF
22	Alexandre Domingues Gonçalves, Lúcia Maria de A. Drummond, Artur Alves Pessoa, Peter M. Hahn	Improving Lower Bounds for the Quadratic Assignment Problem by applying a Distributed Dual Ascent Algorithm	CoRR	2013	DBLP BibTeX RDF
22	Marcelo C. P. Santos, Lúcia M. A. Drummond, Eduardo Uchoa	A distributed dual ascent algorithm for the Hop-constrained Steiner Tree Problem.	Oper. Res. Lett.	2010	DBLP DOI BibTeX RDF
22	Lúcia M. A. Drummond, Marcelo C. P. Santos, Eduardo Uchoa	A distributed dual ascent algorithm for Steiner problems in multicast routing.	Networks	2009	DBLP DOI BibTeX RDF
22	Marco A. Boschetti, Aristide Mingozzi, Salvatore Ricciardelli	A dual ascent procedure for the set partitioning problem.	Discret. Optim.	2008	DBLP DOI BibTeX RDF
22	Jakob Krarup	Dual ascent: variations of a theme.	Ann. Oper. Res.	2007	DBLP DOI BibTeX RDF
22	Lázaro Cánovas, Sergio García 0001, Alfredo Marín 0001	Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique.	Eur. J. Oper. Res.	2007	DBLP DOI BibTeX RDF
22	Bernard Gendron	A note on "a dual-ascent approach to the fixed-charge capacitated network design problem".	Eur. J. Oper. Res.	2002	DBLP DOI BibTeX RDF
22	A. F. Dumb, Walter Kern	A simple dual ascent algorithm for the multilevel facility location problem.	Electron. Notes Discret. Math.	2001	DBLP DOI BibTeX RDF
22	Eric Rosenberg	Dual Ascent for Uncapacitated Telecommunications Network Design with Access, Backbone, and Switch Costs.	Telecommun. Syst.	2001	DBLP DOI BibTeX RDF
22	Antonio Frangioni, Giorgio Gallo	A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems.	INFORMS J. Comput.	1999	DBLP DOI BibTeX RDF
22	Ishwar Murthy, Phil K. Seo	A dual-ascent procedure for the file allocation and join site selection problem on a telecommunications network.	Networks	1999	DBLP DOI BibTeX RDF
22	Sabyasachi Mitra, Ishwar Murthy	A Dual Ascent Procedure with Valid Inequalities for Designing Hierarchical Network Topologies.	INFORMS J. Comput.	1998	DBLP DOI BibTeX RDF
22	Siddhartha S. Syam	A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals.	Eur. J. Oper. Res.	1998	DBLP DOI BibTeX RDF
22	Zhi-Quan Luo, Paul Tseng	On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization.	Math. Oper. Res.	1993	DBLP DOI BibTeX RDF
22	Teodor Gabriel Crainic, Louis Delorme	Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements.	Transp. Sci.	1993	DBLP DOI BibTeX RDF
22	Anantaram Balakrishnan, Thomas L. Magnanti, Richard T. Wong	A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design.	Oper. Res.	1989	DBLP DOI BibTeX RDF
22	Richard T. Wong	A dual ascent approach for steiner tree problems on a directed graph.	Math. Program.	1984	DBLP DOI BibTeX RDF
22	Marcelo C. P. Santos, Lúcia M. A. Drummond, Eduardo Uchoa	A Distributed Primal-Dual Heuristic for Steiner Problems in Networks.	WEA	2007	DBLP DOI BibTeX RDF
17	Thomas L. Magnanti, Dan Stratila	Separable Concave Optimization Approximately Equals Piecewise Linear Optimization.	IPCO	2004	DBLP DOI BibTeX RDF