:: Library Catalog

कवर छवि

में बचाया:

ग्रंथसूची विवरण
मुख्य लेखकों:	Baeckelant, Timothy, Vandaele, Arnaud, Gillis, Nicolas
स्वरूप:	Preprint
प्रकाशित:	2026
विषय:	Optimization and Control Discrete Mathematics
ऑनलाइन पहुंच:	https://arxiv.org/abs/2605.14058
टैग:	टैग जोड़ें कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!

समान संसाधन

Accelerated Evaluation of Ollivier-Ricci Curvature Lower Bounds: Bridging Theory and Computation
द्वारा: Kang, Wonwoo, और अन्य
प्रकाशित: (2024)

Shortest Paths in Graphs of Convex Sets
द्वारा: Marcucci, Tobia, और अन्य
प्रकाशित: (2021)

On Circuit Diameter Bounds via Circuit Imbalances
द्वारा: Dadush, Daniel, और अन्य
प्रकाशित: (2021)

Rank-one Boolean tensor factorization and the multilinear polytope
द्वारा: Del Pia, Alberto, और अन्य
प्रकाशित: (2022)

Asymptotic Bounds for the Traveling Salesman Problem with Drone
द्वारा: Lee, Jae Hyeok, और अन्य
प्रकाशित: (2026)

Lower bounds for the integrality gap of the bi-directed cut formulation of the Steiner Tree Problem
द्वारा: Bernardelli, Ambrogio Maria, और अन्य
प्रकाशित: (2024)

Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack
द्वारा: Schade, Jamico, और अन्य
प्रकाशित: (2023)

Tight Bounds for the Maximum Distance Over a Polytope to a Given Point
द्वारा: Costandin, Marius, और अन्य
प्रकाशित: (2023)

Constrained Shortest-Path Reformulations via Decision Diagrams for Structured Two-stage Optimization Problems
द्वारा: Lozano, Leonardo, और अन्य
प्रकाशित: (2022)

On Supportedness in Multi-Objective Combinatorial Optimization
द्वारा: Könen, David, और अन्य
प्रकाशित: (2025)

Assortment Optimization For Conference Goodies With Indifferent Attendees
द्वारा: Gutiérrez, Fernanda, और अन्य
प्रकाशित: (2024)

On the integrality Gap of Small Asymmetric Traveling Salesman Problems: A Polyhedral and Computational Approach
द्वारा: Vercesi, Eleonora, और अन्य
प्रकाशित: (2025)

A Knowledge Compilation Take on Binary Polynomial Optimization
द्वारा: Capelli, Florent, और अन्य
प्रकाशित: (2023)

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach
द्वारा: Proença, Nathan Benedetto, और अन्य
प्रकाशित: (2026)

On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
द्वारा: Tellache, Nour ElHouda, और अन्य
प्रकाशित: (2025)

Stable Set Polytopes with High Lift-and-Project Ranks for the Lovász-Schrijver SDP Operator
द्वारा: Au, Yu Hin, और अन्य
प्रकाशित: (2023)

On Rank-Monotone Graph Operations and Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
द्वारा: Au, Yu Hin, और अन्य
प्रकाशित: (2024)

On the Computational Complexity of Multi-Objective Ordinal Unconstrained Combinatorial Optimization
द्वारा: Figueira, José Rui, और अन्य
प्रकाशित: (2024)

Real-time Optimization of Transport Chains for Single Wagon Load Railway Transport
द्वारा: Moldenhauer, Carsten, और अन्य
प्रकाशित: (2025)

The Integrality Gap of the Traveling Salesman Problem is $4/3$ if the LP Solution Has at Most $n+6$ Non-zero Components
द्वारा: Villa, Tullio, और अन्य
प्रकाशित: (2025)

Multilevel Facility Location Optimization: A Novel Integer Programming Formulation and Approaches to Heuristic Solutions
द्वारा: Alidaee, Bahram, और अन्य
प्रकाशित: (2024)

Towards a geometric characterization of unbounded integer cubic optimization problems via thin rays
द्वारा: Del Pia, Alberto
प्रकाशित: (2025)

Convex mixed-integer optimization with Frank-Wolfe methods
द्वारा: Hendrych, Deborah, और अन्य
प्रकाशित: (2022)

System Architecture Optimization Strategies: Dealing with Expensive Hierarchical Problems
द्वारा: Bussemaker, Jasper H., और अन्य
प्रकाशित: (2025)

Randomized Max-Vertex-Cover Interdiction with Matroid Constraints
द्वारा: Wang, Changjun, और अन्य
प्रकाशित: (2026)

On the Virtual Network Embedding polytope
द्वारा: Benhamiche, Amal, और अन्य
प्रकाशित: (2026)

Facet-Defining Inequalities for the Angle-Based DC Optimal Transmission Switching Formulation
द्वारा: Jabbari-Marand, Behnam, और अन्य
प्रकाशित: (2026)

Capacitated power dominating set problem: a solution approach based on forbidden propagation sets
द्वारा: Lucci, Mauro, और अन्य
प्रकाशित: (2026)

A column-generation approach for an electricity technician routing and scheduling problem with a lexicographic objective
द्वारा: Bangerter, Elise, और अन्य
प्रकाशित: (2026)

Minimum Cut Representability of Stable Matching Problems
द्वारा: Faenza, Yuri, और अन्य
प्रकाशित: (2025)

An SDP Relaxation for the Sparse Integer Least Squares Problem
द्वारा: Del Pia, Alberto, और अन्य
प्रकाशित: (2022)

Geoffrion's theorem beyond finiteness and rationality
द्वारा: Dey, Santanu S., और अन्य
प्रकाशित: (2025)

Order acceptance and scheduling in capacitated job shops
द्वारा: Linß, Florian, और अन्य
प्रकाशित: (2024)

A review of minimum cost box searching games
द्वारा: Lidbetter, Thomas
प्रकाशित: (2025)

Market proliferation and the impact of locational complexity on network restructuring
द्वारा: Pinar-Pérez, J. M., और अन्य
प्रकाशित: (2024)

Highly Connected Graph Partitioning: Exact Formulation and Solution Methods
द्वारा: Swamy, Rahul, और अन्य
प्रकाशित: (2024)

An exact approach for the multi-depot electric vehicle scheduling problem
द्वारा: Haslinger, Xenia, और अन्य
प्रकाशित: (2025)

Factorized binary polynomial optimization
द्वारा: Del Pia, Alberto
प्रकाशित: (2024)

Projection-width as a structural parameter for discrete separable optimization
द्वारा: Del Pia, Alberto
प्रकाशित: (2025)

Chorded cycle facets of the clique partitioning polytope
द्वारा: Irmai, Jannik, और अन्य
प्रकाशित: (2024)