Cover Image

Facet-Defining Inequalities for the Angle-Based DC Optimal Transmission Switching Formulation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Jabbari-Marand, Behnam, Escobedo, Adolfo R.
Format:	Preprint
Published:	2026
Subjects:	Discrete Mathematics Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Tight Formulation for the Dial-a-Ride Problem
by: Gaul, Daniela, et al.
Published: (2023)

Highly Connected Graph Partitioning: Exact Formulation and Solution Methods
by: Swamy, Rahul, et al.
Published: (2024)

Recommend-to-Match with Random Supply Rejections: Formulation, Approximation, and Analysis
by: Liu, Haoyue, et al.
Published: (2025)

Multilevel Facility Location Optimization: A Novel Integer Programming Formulation and Approaches to Heuristic Solutions
by: Alidaee, Bahram, et al.
Published: (2024)

A Branch-and-Cut Algorithm for the Optimal Design of Parking Lots with One-way and Two-way Lanes
by: Thomas, Helen, et al.
Published: (2025)

New Sequence-Independent Lifting Techniques for Cutting Planes and When They Induce Facets
by: Prasad, Siddharth, et al.
Published: (2024)

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach
by: Proença, Nathan Benedetto, et al.
Published: (2026)

Randomized Max-Vertex-Cover Interdiction with Matroid Constraints
by: Wang, Changjun, et al.
Published: (2026)

On the Virtual Network Embedding polytope
by: Benhamiche, Amal, et al.
Published: (2026)

Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers
by: Baeckelant, Timothy, et al.
Published: (2026)

Capacitated power dominating set problem: a solution approach based on forbidden propagation sets
by: Lucci, Mauro, et al.
Published: (2026)

A column-generation approach for an electricity technician routing and scheduling problem with a lexicographic objective
by: Bangerter, Elise, et al.
Published: (2026)

Asymptotic Bounds for the Traveling Salesman Problem with Drone
by: Lee, Jae Hyeok, et al.
Published: (2026)

Minimum Cut Representability of Stable Matching Problems
by: Faenza, Yuri, et al.
Published: (2025)

Real-time Optimization of Transport Chains for Single Wagon Load Railway Transport
by: Moldenhauer, Carsten, et al.
Published: (2025)

An SDP Relaxation for the Sparse Integer Least Squares Problem
by: Del Pia, Alberto, et al.
Published: (2022)

Geoffrion's theorem beyond finiteness and rationality
by: Dey, Santanu S., et al.
Published: (2025)

Shortest Paths in Graphs of Convex Sets
by: Marcucci, Tobia, et al.
Published: (2021)

Lower bounds for the integrality gap of the bi-directed cut formulation of the Steiner Tree Problem
by: Bernardelli, Ambrogio Maria, et al.
Published: (2024)

Order acceptance and scheduling in capacitated job shops
by: Linß, Florian, et al.
Published: (2024)

A review of minimum cost box searching games
by: Lidbetter, Thomas
Published: (2025)

Market proliferation and the impact of locational complexity on network restructuring
by: Pinar-Pérez, J. M., et al.
Published: (2024)

On Supportedness in Multi-Objective Combinatorial Optimization
by: Könen, David, et al.
Published: (2025)

Towards a geometric characterization of unbounded integer cubic optimization problems via thin rays
by: Del Pia, Alberto
Published: (2025)

An exact approach for the multi-depot electric vehicle scheduling problem
by: Haslinger, Xenia, et al.
Published: (2025)

Factorized binary polynomial optimization
by: Del Pia, Alberto
Published: (2024)

Rank-one Boolean tensor factorization and the multilinear polytope
by: Del Pia, Alberto, et al.
Published: (2022)

Projection-width as a structural parameter for discrete separable optimization
by: Del Pia, Alberto
Published: (2025)

Chorded cycle facets of the clique partitioning polytope
by: Irmai, Jannik, et al.
Published: (2024)

Normalizations of factorizations over convex cones and their effects on extension complexity
by: Brown, Adam, et al.
Published: (2025)

Beyond hypergraph acyclicity: limits of tractability for pseudo-Boolean optimization
by: Del Pia, Alberto, et al.
Published: (2024)

Revisiting some classical linearizations of the quadratic binary optimization problem
by: Punnen, Abraham P., et al.
Published: (2024)

Robust Deterministic Policies for Markov Decision Processes under Budgeted Uncertainty
by: Wu, Fei, et al.
Published: (2024)

Extended formulations for the multilinear polytope of acyclic hypergraphs
by: Del Pia, Alberto, et al.
Published: (2025)

Constrained Shortest-Path Reformulations via Decision Diagrams for Structured Two-stage Optimization Problems
by: Lozano, Leonardo, et al.
Published: (2022)

The complete edge relaxation for binary polynomial optimization
by: Del Pia, Alberto, et al.
Published: (2025)

Aircraft routing: periodicity and complexity
by: Meunier, Frédéric, et al.
Published: (2025)

On the integrality Gap of Small Asymmetric Traveling Salesman Problems: A Polyhedral and Computational Approach
by: Vercesi, Eleonora, et al.
Published: (2025)

Filling in pattern designs for incomplete pairwise comparison matrices: (quasi-)regular graphs with minimal diameter
by: Bozóki, Sándor, et al.
Published: (2020)

Efficient Sparse Flow Decomposition Methods for RNA Multi-Assembly
by: Besançon, Mathieu
Published: (2025)