Shortest Paths in Graphs of Convex Sets
Fuente:
arXiv
Guardado en:
| Autores principales: | Marcucci, Tobia, Umenberger, Jack, Parrilo, Pablo A., Tedrake, Russ |
|---|---|
| Formato: | Preprint |
| Publicado: |
2021
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
A Unified and Scalable Method for Optimization over Graphs of Convex Sets
por: Marcucci, Tobia
Publicado: (2025)
por: Marcucci, Tobia
Publicado: (2025)
A New Semidefinite Relaxation for Linear and Piecewise-Affine Optimal Control with Time Scaling
por: Yang, Lujie, et al.
Publicado: (2025)
por: Yang, Lujie, et al.
Publicado: (2025)
Constrained Shortest-Path Reformulations via Decision Diagrams for Structured Two-stage Optimization Problems
por: Lozano, Leonardo, et al.
Publicado: (2022)
por: Lozano, Leonardo, et al.
Publicado: (2022)
Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers
por: Baeckelant, Timothy, et al.
Publicado: (2026)
por: Baeckelant, Timothy, et al.
Publicado: (2026)
On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
por: Tellache, Nour ElHouda, et al.
Publicado: (2025)
por: Tellache, Nour ElHouda, et al.
Publicado: (2025)
Highly Connected Graph Partitioning: Exact Formulation and Solution Methods
por: Swamy, Rahul, et al.
Publicado: (2024)
por: Swamy, Rahul, et al.
Publicado: (2024)
Two-person Positive Shortest Path Games Have Nash Equilibria in Pure Stationary Strategies
por: Boros, Endre, et al.
Publicado: (2024)
por: Boros, Endre, et al.
Publicado: (2024)
Multi-Query Shortest-Path Problem in Graphs of Convex Sets
por: Morozov, Savva, et al.
Publicado: (2024)
por: Morozov, Savva, et al.
Publicado: (2024)
Stable Set Polytopes with High Lift-and-Project Ranks for the Lovász-Schrijver SDP Operator
por: Au, Yu Hin, et al.
Publicado: (2023)
por: Au, Yu Hin, et al.
Publicado: (2023)
On Rank-Monotone Graph Operations and Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
por: Au, Yu Hin, et al.
Publicado: (2024)
por: Au, Yu Hin, et al.
Publicado: (2024)
Geometry of the Reformulation-Linearization-Technique: Domination of Disjunctions
por: Hof, Hugo A., et al.
Publicado: (2025)
por: Hof, Hugo A., et al.
Publicado: (2025)
Convex mixed-integer optimization with Frank-Wolfe methods
por: Hendrych, Deborah, et al.
Publicado: (2022)
por: Hendrych, Deborah, et al.
Publicado: (2022)
Minimum Cut Representability of Stable Matching Problems
por: Faenza, Yuri, et al.
Publicado: (2025)
por: Faenza, Yuri, et al.
Publicado: (2025)
Multilevel Facility Location Optimization: A Novel Integer Programming Formulation and Approaches to Heuristic Solutions
por: Alidaee, Bahram, et al.
Publicado: (2024)
por: Alidaee, Bahram, et al.
Publicado: (2024)
Real-time Optimization of Transport Chains for Single Wagon Load Railway Transport
por: Moldenhauer, Carsten, et al.
Publicado: (2025)
por: Moldenhauer, Carsten, et al.
Publicado: (2025)
An SDP Relaxation for the Sparse Integer Least Squares Problem
por: Del Pia, Alberto, et al.
Publicado: (2022)
por: Del Pia, Alberto, et al.
Publicado: (2022)
Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach
por: Proença, Nathan Benedetto, et al.
Publicado: (2026)
por: Proença, Nathan Benedetto, et al.
Publicado: (2026)
Geoffrion's theorem beyond finiteness and rationality
por: Dey, Santanu S., et al.
Publicado: (2025)
por: Dey, Santanu S., et al.
Publicado: (2025)
Randomized Max-Vertex-Cover Interdiction with Matroid Constraints
por: Wang, Changjun, et al.
Publicado: (2026)
por: Wang, Changjun, et al.
Publicado: (2026)
On the Virtual Network Embedding polytope
por: Benhamiche, Amal, et al.
Publicado: (2026)
por: Benhamiche, Amal, et al.
Publicado: (2026)
Facet-Defining Inequalities for the Angle-Based DC Optimal Transmission Switching Formulation
por: Jabbari-Marand, Behnam, et al.
Publicado: (2026)
por: Jabbari-Marand, Behnam, et al.
Publicado: (2026)
Lower bounds for the integrality gap of the bi-directed cut formulation of the Steiner Tree Problem
por: Bernardelli, Ambrogio Maria, et al.
Publicado: (2024)
por: Bernardelli, Ambrogio Maria, et al.
Publicado: (2024)
Order acceptance and scheduling in capacitated job shops
por: Linß, Florian, et al.
Publicado: (2024)
por: Linß, Florian, et al.
Publicado: (2024)
A review of minimum cost box searching games
por: Lidbetter, Thomas
Publicado: (2025)
por: Lidbetter, Thomas
Publicado: (2025)
Market proliferation and the impact of locational complexity on network restructuring
por: Pinar-Pérez, J. M., et al.
Publicado: (2024)
por: Pinar-Pérez, J. M., et al.
Publicado: (2024)
On Supportedness in Multi-Objective Combinatorial Optimization
por: Könen, David, et al.
Publicado: (2025)
por: Könen, David, et al.
Publicado: (2025)
Towards a geometric characterization of unbounded integer cubic optimization problems via thin rays
por: Del Pia, Alberto
Publicado: (2025)
por: Del Pia, Alberto
Publicado: (2025)
An exact approach for the multi-depot electric vehicle scheduling problem
por: Haslinger, Xenia, et al.
Publicado: (2025)
por: Haslinger, Xenia, et al.
Publicado: (2025)
Factorized binary polynomial optimization
por: Del Pia, Alberto
Publicado: (2024)
por: Del Pia, Alberto
Publicado: (2024)
Rank-one Boolean tensor factorization and the multilinear polytope
por: Del Pia, Alberto, et al.
Publicado: (2022)
por: Del Pia, Alberto, et al.
Publicado: (2022)
Projection-width as a structural parameter for discrete separable optimization
por: Del Pia, Alberto
Publicado: (2025)
por: Del Pia, Alberto
Publicado: (2025)
Chorded cycle facets of the clique partitioning polytope
por: Irmai, Jannik, et al.
Publicado: (2024)
por: Irmai, Jannik, et al.
Publicado: (2024)
Normalizations of factorizations over convex cones and their effects on extension complexity
por: Brown, Adam, et al.
Publicado: (2025)
por: Brown, Adam, et al.
Publicado: (2025)
Capacitated power dominating set problem: a solution approach based on forbidden propagation sets
por: Lucci, Mauro, et al.
Publicado: (2026)
por: Lucci, Mauro, et al.
Publicado: (2026)
Beyond hypergraph acyclicity: limits of tractability for pseudo-Boolean optimization
por: Del Pia, Alberto, et al.
Publicado: (2024)
por: Del Pia, Alberto, et al.
Publicado: (2024)
Revisiting some classical linearizations of the quadratic binary optimization problem
por: Punnen, Abraham P., et al.
Publicado: (2024)
por: Punnen, Abraham P., et al.
Publicado: (2024)
Robust Deterministic Policies for Markov Decision Processes under Budgeted Uncertainty
por: Wu, Fei, et al.
Publicado: (2024)
por: Wu, Fei, et al.
Publicado: (2024)
Extended formulations for the multilinear polytope of acyclic hypergraphs
por: Del Pia, Alberto, et al.
Publicado: (2025)
por: Del Pia, Alberto, et al.
Publicado: (2025)
The complete edge relaxation for binary polynomial optimization
por: Del Pia, Alberto, et al.
Publicado: (2025)
por: Del Pia, Alberto, et al.
Publicado: (2025)
Aircraft routing: periodicity and complexity
por: Meunier, Frédéric, et al.
Publicado: (2025)
por: Meunier, Frédéric, et al.
Publicado: (2025)
Ejemplares similares
-
A Unified and Scalable Method for Optimization over Graphs of Convex Sets
por: Marcucci, Tobia
Publicado: (2025) -
A New Semidefinite Relaxation for Linear and Piecewise-Affine Optimal Control with Time Scaling
por: Yang, Lujie, et al.
Publicado: (2025) -
Constrained Shortest-Path Reformulations via Decision Diagrams for Structured Two-stage Optimization Problems
por: Lozano, Leonardo, et al.
Publicado: (2022) -
Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers
por: Baeckelant, Timothy, et al.
Publicado: (2026) -
On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
por: Tellache, Nour ElHouda, et al.
Publicado: (2025)