Cover Image

Serial and Parallel Two-Column Probing for Mixed-Integer Programming

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dai, Yongzheng, Chen, Chen
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control 90C10
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Parallelized Conflict Graph Cut Generation
by: Dai, Yongzheng, et al.
Published: (2023)

Linear Decision Tree Policies for Integer Linear Programs
by: Guyard, Théo, et al.
Published: (2026)

Introducing Clause Cuts: Strong No-Good Cuts for MaxSAT Problems in Mixed Integer Linear Programming
by: Engelhardt, Max, et al.
Published: (2025)

Linear Threshold for Oertel's Conjecture on the Mixed-Integer Volume
by: Cheng, Hongyu, et al.
Published: (2026)

Implied Integrality in Mixed-Integer Optimization
by: van der Hulst, Rolf, et al.
Published: (2025)

Augmentation Algorithms for Integer Programs with Total Variation-like Regularization
by: Yang, Dominic, et al.
Published: (2025)

Accelerating Column Generation in Highly Degenerate Integer Programming Problems with Template Pricing
by: Marshall, Luke, et al.
Published: (2026)

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

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

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

Solving Cutting Stock Problems via an Extended Ryan-Foster Branching Scheme and Fast Column Generation
by: da Silva, Renan F. F., et al.
Published: (2023)

Applying a Random-Key Optimizer on Mixed Integer Programs
by: Chaves, Antonio A., et al.
Published: (2026)

Bi-Objective Optimization over the Efficient Set of Multi-Objective Integer Quadratic Problem
by: Bencheikh, Ali, et al.
Published: (2024)

A Successive Refinement for Solving Stochastic Programs with Decision-Dependent Random Capacities
by: Medal, Hugh, et al.
Published: (2024)

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

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

Folding Mixed-Integer Linear Programs and Reflection Symmetries
by: van der Hulst, Rolf
Published: (2026)

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

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

On the Relationship Between the Value Function and the Efficient Frontier of a Mixed Integer Linear Optimization Problem
by: Fallah, Samira, et al.
Published: (2023)

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

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

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

Improving Directions in Mixed Integer Bilevel Linear Optimization
by: Battista, Federico, et al.
Published: (2025)

A diving heuristic for mixed-integer problems with unbounded semi-continuous variables
by: Halbig, Katrin, et al.
Published: (2024)

Multi-layer continuous carbon fiber pattern optimization and a spline based path planning interpretation
by: Wein, Fabian, et al.
Published: (2024)

A Framework for Handling and Exploiting Symmetry in Benders' Decomposition
by: Hojny, Christopher, et al.
Published: (2025)

Extended formulations for the integer hull of strictly $Δ$-modular cographic polyhedral cones
by: Paat, Joseph, et al.
Published: (2023)

Valid Inequalities for Mixed Integer Bilevel Linear Optimization Problems
by: Tahernejad, Sahar, et al.
Published: (2025)

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

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

A Boosted-DCA with Power-Sum-DC Decomposition for Linearly Constrained Polynomial Programs
by: Zhang, Hu, et al.
Published: (2022)

A polynomially solvable case of unconstrained (-1,1)-quadratic fractional optimization
by: Yang, Meijia, et al.
Published: (2024)

Relaxations for binary polynomial optimization via signed certificates
by: Xu, Liding, et al.
Published: (2024)

Cutting planes for signomial programming
by: Xu, Liding, et al.
Published: (2022)

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

Better and Simpler Reducibility Bounds over the Integers
by: Levin, Asaf
Published: (2025)

A Non-Archimedean Interior Point Method for Solving Lexicographic Multi-Objective Quadratic Programming Problems
by: Fiaschi, Lorenzo, et al.
Published: (2021)

Robust Capacity Expansion Modelling for Renewable Energy Systems
by: Kebrich, Sebastian, et al.
Published: (2025)

On the Smallest Support Size of Integer Solutions to Linear Equations
by: Dubey, Yatharth, et al.
Published: (2023)