14 papers · ranked by Valyu relevance
Fengqiao Luo, S. C. Mehrotra
Algorithm for Mixed-Integer Convex and Two-Stage Convex Programs using Cutting Planes Authors: ['Fengqiao Luo' 'S. C. Mehrotra'] Abstract We consider a general mixed-integer convex program. We first develop an algorithm for solving this problem, and show its finite convergence. We then develop a finitely convergent…
Akif Çördük, Piotr Sielski, Boucher, Alice + 1 more
We introduce a fusion of GPU accelerated primal heuristics for Mixed Integer Programming. Leveraging GPU acceleration enables exploration of larger search regions and faster iterations. A GPU-accelerated PDLP serves as an approximate LP solver, while a new probing cache facilitates rapid roundings and early…
Mikhail A. Bragin, Emily L. Tucker
Mixed-Integer Linear Programming (MILP) plays an important role across a range of scientific disciplines and within areas of strategic importance to society. The MILP problems, however, suffer from combinatorial complexity. Because of integer decision variables, as the problem size increases, the number of possible…
Justo Puerto, Jose A. Ruiz-Alba
This paper analyses the feasible sets structure of general mixed integer linear programs (MIPs) and its relationship with the existence of a finite cardinality test set which can be applied in augmentation algorithms. We derive and characterize a computable, finite test set for MIPs which can be embedded in a finite…
Yongzheng Dai, Chen Chen
We develop a novel primal heuristic for nonconvex Mixed-Integer Quadratically Constrained Quadratic Programs (MIQCQPs). The method is built around a convex approximation that is dynamically adjusted within a feasibility-pump-style alternating heuristic. Approximations are adjusted based on the structure of the MIQCQP…
Lara Scavuzzo, Karen Aardal, Andrea Lodi, Neil Yorke-Smith
Mixed Integer Linear Programming (MILP) is a pillar of mathematical optimization that offers a powerful modeling language for a wide range of applications. The main engine for solving MILPs is the branch-and-bound algorithm. Adding to the enormous algorithmic progress in MILP solving of the past decades, in more recent…
Daniel Molina-Pérez, Edgar Alfredo Portilla-Flores, Efrén Mezura-Montes, Eduardo Vega-Alvarado + 2 more
'Efrén Mezura-Montes' 'Eduardo Vega-Alvarado' 'María Bárbara Calva-Yañez' 'Thomas Stützle'] Mixed integer nonlinear programming (MINLP) addresses optimization problems that involve continuous and discrete/integer decision variables, as well as nonlinear functions. These problems often exhibit multiple discontinuous…
Gioni Mexi, Sébastien Designolle, Mathieu Besançon
We propose a primal heuristic for quadratic mixed-integer problems. Our method extends the Boscia framework – originally a mixedinteger convex solver leveraging a Frank-Wolfe-based branch-and-bound approach – to address nonconvex quadratic objective functions and constraints. We reformulate nonlinear constraints…
Luke Fina, Christopher Petersen, Matthew Hale
Feasibility Guarantees Authors: ['Luke Fina' 'Christopher Petersen' 'Matthew Hale'] In this paper we solve mixed-integer linear programs (MILPs) via distributed asynchronous saddle point computation. To solve a MILP, we relax it with a linear program approximation. We first show that if the linear program relaxation…
Xuan Lin
This paper presents a comparative study of data-driven acceleration techniques for mixed-integer bilinear programs (MIBLPs) applied to robot motion planning. MIBLPs combine discrete decision variables and nonlinear constraints, making them computationally challenging for real-time robotics applications. We investigate…
Frank de Meijer, Renata Sotirov
and Algorithms Authors: ['Frank de Meijer' 'Renata Sotirov'] This paper presents the Lagrangian duality theory for mixed-integer semidefinite programming (MISDP). We derive the Lagrangian dual problem and prove that the resulting Lagrangian dual bound dominates the bound obtained from the continuous relaxation of the…
Rafael Muñoz-Sánchez, Iris Martínez-Salazar, José Luis González-Velarde, Yasmín Á. Ríos Solís + 1 more
'José Luis González-Velarde' 'Yasmín Á. Ríos Solís' 'Mazyar Ghadiri Nejad'] Two hybrid flow shop scheduling lines must be coordinated to assemble batches of terminated products at their last stage. Each product is thus composed of two jobs, each produced in one of the lines. The set of jobs is to be processed in a…
Elisabeth Gaar, Jon Lee, Ivana Ljubić, Markus Sinnl + 1 more
We study a class of integer bilevel programs with second-order cone constraints at the upper-level and a convex-quadratic objective function and linear constraints at the lower-level. We develop disjunctive cuts (DCs) to separate bilevel-infeasible solutions using a second-order-cone-based cut-generating procedure. We…
David A. Liñán, Luis A. Ricardez-Sandoval
Mixed integer nonlinear programming (MINLP) in chemical engineering originated as a tool for solving optimal process synthesis and design problems. Since then, the application of MINLP has expanded to encompass control and operational decisions that are in line with the arising challenges faced by the industry, e.g.…