Image de couverture de livre

Branching with a pre-specified finite list of $k$-sparse split sets for binary MILPs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Dey, Santanu S., Moran, Diego, Xu, Jingye
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Sensitivity analysis for mixed binary quadratic programming
par: Cifuentes, Diego, et autres
Publié: (2023)

Asymptotically tight Lagrangian dual of smooth nonconvex problems via improved error bound of Shapley-Folkman Lemma
par: Dey, Santanu S, et autres
Publié: (2026)

Lagrangian dual with zero duality gap that admits decomposition
par: Cifuentes, Diego, et autres
Publié: (2024)

Probabilistic analysis of dual decomposition on two-stage stochastic integer programs
par: Dey, Santanu S., et autres
Publié: (2026)

Existence of reciprocal matrices with specified orders for the right and inverse left Perron eigenvectors
par: Furtado, Susana, et autres
Publié: (2026)

Geoffrion's theorem beyond finiteness and rationality
par: Dey, Santanu S., et autres
Publié: (2025)

Improving Full Strong Branching Decisions by Incorporating Additional Information
par: Shah, Prachi, et autres
Publié: (2025)

Learning Branching Policies for MILPs with Proximal Policy Optimization
par: Mhamed, Abdelouahed Ben, et autres
Publié: (2025)

Extreme Strong Branching for QCQPs
par: Dey, Santanu S., et autres
Publié: (2025)

Non-Monotonicity of Branching Rules with respect to Linear Relaxations
par: Shah, Prachi, et autres
Publié: (2024)

On the minimum doubly resolving set problem in line graphs
par: Ye, Qingjie
Publié: (2026)

Towards Enabling Learning for Time-Varying finite horizon Sequential Decision-Making Problems*
par: Tiwari, Dhananjay, et autres
Publié: (2025)

The Integrated Vehicle and Pollster Routing Problem
par: Gutiérrez, Sandra, et autres
Publié: (2019)

Convexification of a Separable Function over a Polyhedral Ground Set
par: Dey, Santanu S., et autres
Publié: (2025)

The distributed biased min-consensus protocol revisited: pre-specified finite time control strategies and small-gain based analysis
par: Mo, Yuanqiu, et autres
Publié: (2024)

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem
par: Gao, Xuan-Zhao, et autres
Publié: (2024)

Optimization of trigonometric polynomials with crystallographic symmetry and spectral bounds for set avoiding graphs
par: Hubert, Evelyne, et autres
Publié: (2023)

A second-order cone representable class of nonconvex quadratic programs
par: Dey, Santanu S., et autres
Publié: (2025)

Low degree sum-of-squares bounds for the stability number: a copositive approach
par: Vargas, Luis Felipe, et autres
Publié: (2025)

Polyhedral study of a temporal rural postman problem: application in inspection of railway track without disturbing train schedules
par: Buriuly, Somnath, et autres
Publié: (2024)

Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem
par: Großmann, Ernestine, et autres
Publié: (2024)

Improvements on Permutation Reconstruction from Minors
par: Ma, Yiming, et autres
Publié: (2024)

On disjunction convex hulls by lifting
par: Qu, Yushan, et autres
Publié: (2024)

An Efficient Algorithm for Vertex Enumeration of Arrangement
par: Dong, Zelin, et autres
Publié: (2024)

A computational study of cutting-plane methods for multi-stage stochastic integer programs
par: Bansal, Akul, et autres
Publié: (2024)

A characterization of unimodular hypergraphs with disjoint hyperedges
par: Caoduro, Marco, et autres
Publié: (2024)

Optimization Models for the Quadratic Traveling Salesperson Problem
par: Chen, Yuxiao, et autres
Publié: (2024)

A Modular-Form Framework for Global Optimality in the Asymmetric Traveling-Salesman Problem
par: Gupta, Varsha
Publié: (2024)

Hub location with congestion and time-sensitive demand
par: Domínguez-Bravo, Carmen-Ana, et autres
Publié: (2024)

Bilevel Programming for Pebbling Numbers of Lemke Graph Products
par: Pulaj, Jonad, et autres
Publié: (2024)

On Solving the Set Covering Problem with Conflicts on Sets
par: Montemanni, Roberto, et autres
Publié: (2025)

Conformal Rigidity and Spectral Embeddings of Graphs
par: Gouveia, João, et autres
Publié: (2025)

Cutting plane methods with gradient-based heuristics
par: Bùi, Hòa T., et autres
Publié: (2025)

Lower and Upper Bounds for Small Canonical and Ordered Ramsey Numbers
par: Brosch, Daniel, et autres
Publié: (2025)

Strength of the Upper Bounds for the Edge-Weighted Maximum Clique Problem
par: Ciccarelli, Fabio, et autres
Publié: (2025)

Faces of homogeneous cones and applications to homogeneous chordality
par: Gouveia, João, et autres
Publié: (2025)

Stable matchings with switching costs
par: Pittel, Boris, et autres
Publié: (2025)

Integer Carathéodory results with bounded multiplicity
par: Kuhlmann, Stefan
Publié: (2023)

The sum of root-leaf distance interdiction problem with cardinality constraint by upgrading edges on trees
par: Li, Xiao, et autres
Publié: (2023)

A Facet Enumeration Algorithm for Convex Polytopes
par: Yang, Yaguang
Publié: (2019)