Cover Image

On the Number of Degenerate Simplex Pivots

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kukharenko, Kirill, Sanità, Laura
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control Combinatorics 90C05 (Primary), 90C08 (Secondary) F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Extended Dijkstra algorithm and Moore-Bellman-Ford algorithm
by: Cheng, Cong-Dian
Published: (2017)

Semidefinite programming bounds on fractional cut-cover and maximum 2-SAT for highly regular graphs
by: Assumpção, Henrique, et al.
Published: (2025)

A Massively Parallel Interior-Point Method for Arrowhead Linear Programs with Local Linking Structure
by: Kempke, Nils-Christian, et al.
Published: (2024)

Sailing League Problems
by: Schüler, Robert, et al.
Published: (2022)

Simultaneous recovery of a sparse topology and the admittance of an electrical network
by: Samperio, Álvaro
Published: (2023)

Progressively Strengthening and Tuning MIP Solvers for Reoptimization
by: Patel, Krunal Kishor
Published: (2023)

Boscia.jl: A review and tutorial
by: Xiao, Wenjie, et al.
Published: (2025)

Fidelity and interruption control for expensive constrained multi-fidelity blackbox optimization
by: Alarie, Stéphane, et al.
Published: (2023)

An Inexact Modified Quasi-Newton Method for Nonsmooth Regularized Optimization
by: Allaire, Nathan, et al.
Published: (2025)

On the numerical solution of Lasserre relaxations of unconstrained binary quadratic optimization problem
by: Habibi, Soodeh, et al.
Published: (2024)

The frequency $K_i$s for symmetrical traveling salesman problem
by: Wang, Yong
Published: (2025)

Fix-and-Propagate Heuristics Using Low-Precision First-Order LP Solutions for Large-Scale Mixed-Integer Linear Optimization
by: Kempke, Nils-Christian, et al.
Published: (2025)

Efficiency and Convergence Insights in Large-Scale Optimization Using the Improved Inexact-Newton-Smart Algorithm and Interior-Point Framework
by: Renani, Neda Bagheri, et al.
Published: (2025)

Solving Low-Rank Semidefinite Programs via Manifold Optimization
by: Wang, Jie, et al.
Published: (2023)

A Bilevel Hierarchy of Strengthened Complex Moment Relaxations for Complex Polynomial Optimization
by: Wang, Jie
Published: (2024)

A Dual Riemannian ADMM Algorithm for Low-Rank SDPs with Unit Diagonal
by: Wang, Jie, et al.
Published: (2025)

On the Wasserstein alignment problem
by: Pal, Soumik, et al.
Published: (2025)

Developing heuristic solution techniques for large-scale unit commitment models
by: Kempke, Nils-Christian, et al.
Published: (2025)

Semi-Supervised Clustering of Sparse Graphs: Crossing the Information-Theoretic Threshold
by: Sheng, Junda, et al.
Published: (2022)

Predict-then-Calibrate: A New Perspective of Robust Contextual LP
by: Sun, Chunlin, et al.
Published: (2023)

Relaxation strength for multilinear optimization: McCormick strikes back
by: Schutte, Emily, et al.
Published: (2023)

Spectral Outer-Approximation Algorithms for Binary Semidefinite Problems
by: de Roux, Daniel, et al.
Published: (2025)

Rich Vehicle Routing Problem in Disaster Management enabling Temporally-causal Transhipments across Multi-Modal Transportation Network
by: Banerjee, Santanu, et al.
Published: (2025)

Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing
by: Fravel, Jamie, et al.
Published: (2026)

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

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

A Successive Refinement Algorithm for Tri-Level Stochastic Defender-Attacker Problems with Decision-Dependent Probability Distributions
by: Affar, Samuel, et al.
Published: (2024)

Minimizing the determinant of the graph Laplacian
by: Albin, Nathan, et al.
Published: (2024)

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

Discounted Pseudocosts in MILP
by: Patel, Krunal Kishor
Published: (2024)

GPU accelerated variant of Schroeppel-Shamir's algorithm for solving the market split problem
by: Kempke, Nils-Christian, et al.
Published: (2025)

An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems
by: Iida, Einosuke, et al.
Published: (2023)

Total Conformal Rigidity in Graphs
by: Assumpção, Henrique, et al.
Published: (2026)

Optimizing Travel Time and Regenerative Energy for Periodic Timetables
by: Roth, Sarah, et al.
Published: (2026)

An improved approximation algorithm for k-Median
by: Young, Neal E.
Published: (2025)

Bayesian Linear Programming under Learned Uncertainty: Posterior Feasibility Guarantees, Scenario Certification, and Applications
by: Chatterjee, Debashis
Published: (2026)

Flow Shop Scheduling with Inter-Stage Flexibility and Blocking Constraints
by: Nicosia, Gaia, et al.
Published: (2024)

Convex Mixed-Integer Nonlinear Programs Derived from Generalized Disjunctive Programming using Cones
by: Neira, David E. Bernal, et al.
Published: (2021)

Continuity of Filters for Discrete-Time Control Problems Defined by Explicit Equations
by: Feinberg, Eugene A., et al.
Published: (2023)

On the Semidefinite Representability of Continuous Quadratic Submodular Minimization With Applications to Moment Problems
by: Burer, Samuel, et al.
Published: (2025)