15 papers · ranked by Valyu relevance
Timo Berthold, Peter J. Stuckey, Jakob Witzig
Conflict learning algorithms are an important component of modern MIP and CP solvers. But strong conflict information is typically gained by depth-first search. While this is the natural mode for CP solving, it is not for MIP solving. Rapid Learning is a hybrid CP/MIP approach where CP search is applied at the root to…
Chin-Yao Chang, Eric B. Jones, Peter Gräf
—Quantum computing is emerging as a new computing resource that could be superior to conventional computing for certain classes of optimization problems. However, in principle, most existing approaches to quantum optimization are intended to solve unconstrained binary programming problems, while mixed-integer linear…
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…
Duygu Yilmaz Eroglu, Burcu Caglar Gencosman, Fatih Cavdur, H. Cenk Ozmutlu
'H. Cenk Ozmutlu'] In this paper, we analyze a real-world OVRP problem for a production company. Considering real-world constrains, we classify our problem as multicapacitated/heterogeneous fleet/open vehicle routing problem with split deliveries and multiproduct (MCHF/OVRP/SDMP) which is a novel classification of an…
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…
Miles Lubin, Emre Yamangil, Russell Bent, Juan Pablo Vielma
Generalizing both mixed-integer linear optimization and convex optimization, mixed-integer convex optimization possesses broad modeling power but has seen relatively few advances in general-purpose solvers in recent years. In this paper, we intend to provide a broadly accessible introduction to our recent work in…
Alexander Murray, Timm Faulwasser, Veit Hagenmeyer, Mario E. Villanueva + 1 more
'Mario E. Villanueva' 'Boris Houska'] Abstract This paper presents a novel partially distributed outer approximation algorithm, named PaDOA, for solving a class of structured mixed integer convex programming (MICP) problems to global optimality. The proposed scheme uses an iterative outer approximation method for…
Weili Zhang, Charles Nicholson
The objective scaling ensemble approach is a novel two-phase heuristic for integer linear programming problems shown to be effective on a wide variety of integer linear programming problems. The technique identifies and aggregates multiple partial solutions to modify the problem formulation and significantly reduce the…
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…
Albert No
The size of the largest binary single deletion code has been unknown for more than 50 years. It is known that Varshamov-Tenengolts (VT) code is an optimum single deletion code for block length $n\leq10$; however, only a few upper bounds of the size of single deletion code are proposed for larger n. We provide improved…
Sahar Tahernejad, Ted K. Ralphs, Scott DeNegre
In this paper, we describe a comprehensive algorithmic framework for solving mixed integer bilevel linear optimization problems (MIBLPs) using a generalized branch-and-cut approach. The framework presented merges features from existing algorithms (for both traditional mixed integer linear optimization and MIBLPs) with…
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.…
Xinyu Liu, Qun Chen, Yong Deng
This paper proposes an optimization algorithm, the dimension-down iterative algorithm (DDIA), for solving a mixed transportation network design problem (MNDP), which is generally expressed as a mathematical programming with equilibrium constraint (MPEC). The upper level of the MNDP aims to optimize the network…
Maciej Nowak, Tadeusz Trzaskalik, Sebastian Sitarz, Ewa Roszkowska + 1 more
'Marek Szopa'] A problem that appears in many decision models is that of the simultaneous occurrence of deterministic, stochastic, and fuzzy values in the set of multidimensional evaluations. Such problems will be called mixed problems. They lead to the formulation of optimization problems in ordered structures and…