Imagen de Portada

On Circuit Imbalance and 0/1 Circuits for Coloring and Spanning Forest Problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Borgwardt, Steffen, Crawford, Nicholas, Kafer, Sean, Lee, Jon, Morrison, Angela
Formato:	Preprint
Publicado:	2025
Materias:	Optimization and Control 05C69, 52B05, 90C05, 90C27
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On the Hardness of Short and Sign-Compatible Circuit Walks
por: Borgwardt, Steffen, et al.
Publicado: (2024)

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

On the Circuit Diameter Conjecture for Counterexamples to the Hirsch Conjecture
por: Black, Alexander E., et al.
Publicado: (2023)

On the Diameter of a 2-Sum of Polyhedra
por: Borgwardt, Steffen, et al.
Publicado: (2023)

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

On generalized KKT points for the Motzkin-Straus program
por: Beretta, G., et al.
Publicado: (2023)

Application of the Lovász-Schrijver Lift-and-Project Operator to Compact Stable Set Integer Programs
por: Battista, Federico, et al.
Publicado: (2024)

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

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

Integral bases, perfect matchings, and the Petersen graph
por: Abdi, Ahmad, et al.
Publicado: (2025)

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

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

Lower bounds for cube-ideal set-systems
por: Abdi, Ahmad, et al.
Publicado: (2025)

Length-minimizing LED Trees
por: Remešíková, Mariana Sarkociová, et al.
Publicado: (2024)

Large independent sets in recursive Markov random graphs
por: Gupte, Akshay, et al.
Publicado: (2022)

Adaptive Metrics for Norm-Minimization-Based Outer Approximation in Convex Vector Optimization
por: Alshahrani, Mohammed
Publicado: (2026)

The SCIP Optimization Suite 9.0
por: Bolusani, Suresh, et al.
Publicado: (2024)

The SCIP Optimization Suite 10.0
por: Hojny, Christopher, et al.
Publicado: (2025)

Representation of Zeros of a Copositive Matrix via Maximal Cliques of a Graph
por: Kostyukova, O. I., et al.
Publicado: (2024)

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

Sailing League Problems
por: Schüler, Robert, et al.
Publicado: (2022)

First-order majorization-minimization meets high-order majorant: Boosted inexact high-order forward-backward method
por: Kabgani, Alireza, et al.
Publicado: (2025)

Average-case thresholds for exact regularization of linear programs
por: Friedlander, Michael P., et al.
Publicado: (2025)

Exact Solution Procedure for the Log-Linear Continuous Knapsack Problem
por: Lahiri, Somdeb
Publicado: (2024)

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

On the redundancy of transitivity constraints in the clique partitioning problem
por: Sukegawa, Noriyoshi
Publicado: (2026)

A Sparse Smoothing Newton Method for Solving Discrete Optimal Transport Problems
por: Hou, Di, et al.
Publicado: (2023)

Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems
por: Chen, Kaihuang, et al.
Publicado: (2025)

Shortest Circuits in Homology Classes of Graphs
por: Luo, Ye
Publicado: (2025)

Steiner Cut Dominants
por: Conforti, Michele, et al.
Publicado: (2022)

On cone partitions for the min-cut and max-cut problems with non-negative edges
por: Nikolaev, Andrei V., et al.
Publicado: (2023)

A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-quadratic Regularized Optimal Transport Problems
por: Yang, Lei, et al.
Publicado: (2023)

On Solution Uniqueness and Robust Recovery for Sparse Regularization with a Gauge: from Dual Point of View
por: He, Jiahuan, et al.
Publicado: (2023)

Lexicographic Extensions preserve Euclideaness
por: Hochstättler, Winfried, et al.
Publicado: (2025)

Vertex-shellings of Euclidean Oriented Matroids
por: Hochstättler, Winfried, et al.
Publicado: (2023)

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

Distributed accelerated proximal conjugate gradient methods for multi-agent constrained optimization problems
por: Gebrie, Anteneh Getachew
Publicado: (2023)

Accelerating Column Generation in Highly Degenerate Integer Programming Problems with Template Pricing
por: Marshall, Luke, et al.
Publicado: (2026)

A dimension reduction procedure for the selection of Two-spring lattice-spring topologies with minimal fabrication cost and required weighted force-resistance performance
por: Makarenkov, Egor
Publicado: (2025)

A simulation-optimization approach for fractional, profitability-oriented inventory control under service-level type constraints
por: Sun, Tianxiao, et al.
Publicado: (2026)