Copertina

$\mathcal{V}$-Polyhedral Disjunctive Cuts

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Balas, Egon, Kazachkov, Aleksandr M.
Natura:	Preprint
Pubblicazione:	2022
Soggetti:	Optimization and Control 90C11
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Parametric Disjunctive Cuts for Sequences of Mixed Integer Linear Optimization Problems
di: Kelley, Shannon, et al.
Pubblicazione: (2025)

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

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

Hub location problems with asymmetric allocation
di: Espejo, I., et al.
Pubblicazione: (2026)

Exact augmented Lagrangian duality for mixed integer convex optimization
di: Bhardwaj, Avinash, et al.
Pubblicazione: (2022)

GFORS: GPU-Accelerated First-Order Method with Randomized Sampling for Binary Integer Programs
di: Wei, Ningji, et al.
Pubblicazione: (2025)

Exploiting Overlap Information in Chance-constrained Program with Random Right-hand Side
di: Lv, Wei, et al.
Pubblicazione: (2024)

Exact Decomposition Branching exploiting Lattice Structures
di: Halbig, Katrin, et al.
Pubblicazione: (2024)

Bi-Parameterized Two-Stage Stochastic Min-Max and Min-Min Mixed Integer Programs
di: Kang, Sumin, et al.
Pubblicazione: (2025)

The Quadratic Bin Packing Problem: Exact Formulations and Algorithm
di: Chagas, Vítor Gomes, et al.
Pubblicazione: (2026)

Distributionally Risk-Receptive and Robust Multistage Stochastic Integer Programs and Interdiction Models
di: Kang, Sumin, et al.
Pubblicazione: (2024)

Adaptive Partitioning for Chance-Constrained Problems with Finite Support
di: Roland, Marius, et al.
Pubblicazione: (2023)

Augmentation approaches for Mixed Integer Programming
di: Puerto, Justo, et al.
Pubblicazione: (2025)

Presolving and cutting planes for the generalized maximal covering location problem
di: Lv, Wei, et al.
Pubblicazione: (2024)

An efficient branch-and-cut approach for large-scale competitive facility location problems with limited choice rule
di: Chen, Wei-Kun, et al.
Pubblicazione: (2024)

An efficient branch-and-cut approach for the sequential competitive facility location problem under partially binary rule
di: Guo, Yu-Qi, et al.
Pubblicazione: (2025)

Neural Embedded Mixed-Integer Optimization for Location-Routing Problems
di: Kaleem, Waquar, et al.
Pubblicazione: (2024)

An efficient branch-and-cut algorithm for the multiple probabilistic covering location problem
di: Wang, Yan-Ru, et al.
Pubblicazione: (2025)

Solving decision problems with endogenous uncertainty and conditional information revelation using influence diagrams
di: Herrala, Olli, et al.
Pubblicazione: (2023)

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

An Exact Algorithm for Public Transport Line Planning Considering Passenger and Operational Costs and Lost Demand
di: Hansen, Siv Marie Cartland, et al.
Pubblicazione: (2026)

Surrogate-based categorical neighborhoods for mixed-variable blackbox optimization
di: Audet, Charles, et al.
Pubblicazione: (2026)

CatMADS: Mesh Adaptive Direct Search for constrained blackbox optimization with categorical variables
di: Audet, Charles, et al.
Pubblicazione: (2025)

A Frank-Wolfe-based primal heuristic for quadratic mixed-integer optimization
di: Mexi, Gioni, et al.
Pubblicazione: (2025)

A Unifying Convexification Framework for Chance-Constrained Programs via Bilinear Extended Formulations over a Simplex
di: Davarnia, Danial, et al.
Pubblicazione: (2025)

Lagrangian cuts generated by batch to efficiently solve two-stage stochastic mixed-integer program
di: Xiaoyu, Luo, et al.
Pubblicazione: (2024)

Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization
di: Bomze, Immanuel, et al.
Pubblicazione: (2024)

Combining Gradient Information and Primitive Directions for High-Performance Mixed-Integer Optimization
di: Lapucci, Matteo, et al.
Pubblicazione: (2024)

Multi-timescale Stochastic Programming with Applications in Power Systems
di: Zhang, Yihang, et al.
Pubblicazione: (2025)

An extension of an RLT-based solver to MINLP polynomial problems
di: González-Díaz, Julio, et al.
Pubblicazione: (2024)

A Safe Approximation Based on Mixed-Integer Optimization for Non-Convex Distributional Robustness Governed by Univariate Indicator Functions
di: Dienstbier, Jana, et al.
Pubblicazione: (2023)

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

A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem
di: Borges, Jennifer C., et al.
Pubblicazione: (2026)

The Cooperative Maximal Covering Location Problem with ordered partial attractions
di: Domínguez, Concepción, et al.
Pubblicazione: (2023)

Stable formulations for the Capacitated Facility Location Problem with Customer Preferences
di: Domínguez, Concepción, et al.
Pubblicazione: (2025)

Mixed-Integer Linear Optimization for Cardinality-Constrained Random Forests
di: Burgard, Jan Pablo, et al.
Pubblicazione: (2024)

Mixed-Integer Linear Optimization for Semi-Supervised Optimal Classification Trees
di: Burgard, Jan Pablo, et al.
Pubblicazione: (2024)

Benders decomposition algorithms for minimizing the spread of harmful contagions in networks
di: Tanınmış, Kübra, et al.
Pubblicazione: (2023)

Branch and Cut for Partitioning a Graph into a Cycle of Clusters
di: Eifler, Leon, et al.
Pubblicazione: (2024)

Clash of MINLP Relaxations: Piecewise Linear vs. Global Parabolic
di: Göß, Adrian
Pubblicazione: (2026)