Cover Image

Finding Short Paths on Simple Polytopes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Black, Alexander E., Steiner, Raphael
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms Combinatorics Optimization and Control 90C05, 90C27, 90C35, 90C49, 90C57, 90C60
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Polynomial and Pseudopolynomial Algorithms for Two Classes of Bin Packing Instances
by: da Silva, Renan Fernando Franco, et al.
Published: (2026)

Assignment-Routing Optimization with Cutting-Plane Subtour Elimination: Solver and Benchmark Dataset
by: Yuan, Qilong
Published: (2025)

Generalizations of Total Dual Integrality
by: Guenin, Bertrand, et al.
Published: (2025)

Semidefinite approximations for bicliques and biindependent pairs
by: Laurent, Monique, et al.
Published: (2023)

A Canceling Heuristic for the Directed Traveling Salesman Problem
by: Borgwardt, Steffen, et al.
Published: (2026)

The rainbow covering number of clean tangled clutters
by: Abdi, Ahmad, et al.
Published: (2025)

Bayan Algorithm: Detecting Communities in Networks Through Exact and Approximate Optimization of Modularity
by: Aref, Samin, et al.
Published: (2022)

Solving Cutting Stock Problems via an Extended Ryan-Foster Branching Scheme and Fast Column Generation
by: da Silva, Renan F. F., et al.
Published: (2023)

SDP Approach to Quadratic Vertex-Disjoint Paths Problem
by: Xu, Mingming, et al.
Published: (2026)

Designing Tractable Piecewise Affine Policies for Multi-Stage Adjustable Robust Optimization
by: Thomä, Simon, et al.
Published: (2022)

Equitable Routing--Rethinking the Multiple Traveling Salesman Problem
by: Bhadoriya, Abhay Singh, et al.
Published: (2024)

Linear Decision Tree Policies for Integer Linear Programs
by: Guyard, Théo, et al.
Published: (2026)

Troika algorithm: approximate optimization for accurate clique partitioning and clustering of weighted networks
by: Aref, Samin, et al.
Published: (2025)

Binary Cyclic Transversal Polytopes
by: Frede, Jonas, et al.
Published: (2024)

Steiner Cut Dominants
by: Conforti, Michele, et al.
Published: (2022)

Duality of Hoffman constants
by: Pena, Javier F., et al.
Published: (2023)

On exactness of SDP relaxation for the maximum cut problem
by: Bhardwaj, Avinash, et al.
Published: (2025)

Strongly-polynomial time and validation analysis of policy gradient methods
by: Ju, Caleb, et al.
Published: (2024)

Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming
by: Nikolaev, Andrei V., et al.
Published: (2022)

Improved semidefinite programming bounds for the maximum $k$-colorable subgraph problem
by: Barkel, Mathijs, et al.
Published: (2026)

Computational complexity of sum-of-squares bounds for copositive programs
by: Palomba, Marilena, et al.
Published: (2025)

Getting to the Root of the Problem: Sums of Squares for Limits of Trees
by: Brosch, Daniel, et al.
Published: (2024)

Evacuation Planning on Time-Expanded Networks with Integrated Wildfire Information
by: Borgwardt, Steffen, et al.
Published: (2024)

A double-pivot degenerate-robust simplex algorithm for linear programming
by: Yang, Yaguang, et al.
Published: (2021)

On the facet pivot simplex method for linear programming
by: Yang, Yaguang
Published: (2021)

Fixed Topology Minimum-Length Trees with Neighborhoods
by: Blanco, Víctor, et al.
Published: (2024)

A Speed-up for Helsgaun's TSP Heuristic by Relaxing the Positive Gain Criterion
by: Ammann, Sabrina C. L., et al.
Published: (2024)

Adjustable Robust Nonlinear Network Design Without Controllable Elements under Load Scenario Uncertainties
by: Thürauf, Johannes, et al.
Published: (2024)

Solving Hard Instances from Knapsack and Bounded Knapsack Problems: A new state-of-the-art solver
by: da Silva, Renan F. F., et al.
Published: (2026)

Conductance Estimation in Digraphs: Submodular Transformation, Lovász Extension and Dinkelbach Iteration
by: Shao, Sihong, et al.
Published: (2025)

Bi-Objective Optimization over the Efficient Set of Multi-Objective Integer Quadratic Problem
by: Bencheikh, Ali, et al.
Published: (2024)

An Integer Linear Programming Model for the Evolomino Puzzle
by: Nikolaev, Andrei V., et al.
Published: (2026)

A Matrix Optimization Method for Blind Extraction of External Equitable Partitions from Low Pass Graph Signals
by: Teng, Wenshun, et al.
Published: (2025)

Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Terms
by: Bestuzheva, Ksenia, et al.
Published: (2022)

Improved Bounds for the Ultimate Independence Ratio of Odd Wheels
by: Clow, Alexander, et al.
Published: (2025)

Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints
by: Berahas, Albert S., et al.
Published: (2025)

On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation
by: Bollapragada, Raghu, et al.
Published: (2025)

An ODE approach to multiple choice polynomial programming
by: Shao, Sihong, et al.
Published: (2022)

Structural Insights and an IP-based Solution Method for Patient-to-room Assignment under Consideration of Single Room Entitlements
by: Brandt, Tabea, et al.
Published: (2023)

Norm-induced Cuts: Outer Approximation for Lipschitzian Constraint Functions
by: Göß, Adrian, et al.
Published: (2024)