Zobrazeno 1 - 10
of 28
pro vyhledávání: '"P. Mexi"'
For almost two decades, mixed integer programming (MIP) solvers have used graph-based conflict analysis to learn from local infeasibilities during branch-and-bound search. In this paper, we improve MIP conflict analysis by instead using reasoning bas
Externí odkaz:
http://arxiv.org/abs/2410.15110
This paper proposes and evaluates a Multi-Reference Relaxation Enforced Neighborhood Search (MRENS) heuristic within the SCIP solver. This study marks the first integration and evaluation of MRENS in a full-fledged MILP solver, specifically coupled w
Externí odkaz:
http://arxiv.org/abs/2408.00718
Autor:
Bolusani, Suresh, Besançon, Mathieu, Bestuzheva, Ksenia, Chmiela, Antonia, Dionísio, João, Donkiewicz, Tim, van Doornmalen, Jasper, Eifler, Leon, Ghannam, Mohammed, Gleixner, Ambros, Graczyk, Christoph, Halbig, Katrin, Hedtke, Ivo, Hoen, Alexander, Hojny, Christopher, van der Hulst, Rolf, Kamp, Dominik, Koch, Thorsten, Kofler, Kevin, Lentz, Jurgen, Manns, Julian, Mexi, Gioni, Mühmer, Erik, Pfetsch, Marc E., Schlösser, Franziska, Serrano, Felipe, Shinano, Yuji, Turner, Mark, Vigerske, Stefan, Weninger, Dieter, Xu, Liding
The SCIP Optimization Suite provides a collection of software packages for mathematical optimization, centered around the constraint integer programming (CIP) framework SCIP. This report discusses the enhancements and extensions included in the SCIP
Externí odkaz:
http://arxiv.org/abs/2402.17702
The length-constrained cycle partition problem (LCCP) is a graph optimization problem in which a set of nodes must be partitioned into a minimum number of cycles. Every node is associated with a critical time and the length of every cycle must not ex
Externí odkaz:
http://arxiv.org/abs/2401.17937
Strong Branching (SB) is a cornerstone of all modern branching rules used in the Branch-and-Bound (BnB) algorithm, which is at the center of Mixed-Integer Programming solvers. In its full form, SB evaluates all variables to branch on and then selects
Externí odkaz:
http://arxiv.org/abs/2312.07041
Conflict analysis has been successfully generalized from Boolean satisfiability (SAT) solving to mixed integer programming (MIP) solvers, but although MIP solvers operate with general linear inequalities, the conflict analysis in MIP has been limited
Externí odkaz:
http://arxiv.org/abs/2307.14166
Autor:
Mexi, Gioni, Besançon, Mathieu, Bolusani, Suresh, Chmiela, Antonia, Hoen, Alexander, Gleixner, Ambros
We introduce Scylla, a primal heuristic for mixed-integer optimization problems. It exploits approximate solves of the Linear Programming relaxations through the matrix-free Primal-Dual Hybrid Gradient algorithm with specialized termination criteria,
Externí odkaz:
http://arxiv.org/abs/2307.03466
Publikováno v:
EURO Journal on Computational Optimization, Vol 11, Iss , Pp 100066- (2023)
The Feasibility Pump (FP) is one of the best-known primal heuristics for mixed-integer programming (MIP): more than 15 papers suggested various modifications of all of its steps. So far, no variant considered information across multiple iterations, b
Externí odkaz:
https://doaj.org/article/3f43b2d02d8349ee91d3a1f72510b675
Autor:
Asimina Mexi, Ioannis Kafetzakis, Maria Korontzi, Dimitris Karagiannakis, Perikles Kalatzis, Dimitris Mandalidis
Publikováno v:
Sensors, Vol 23, Iss 2, p 609 (2023)
Load carriage and uphill walking are conditions that either individually or in combination can compromise postural control and gait eliciting several musculoskeletal low back and lower limb injuries. The objectives of this study were to investigate p
Externí odkaz:
https://doaj.org/article/d3e9a00c21154b5996aa2da1b4b1ef77
Publikováno v:
Cogito Smart Journal, Vol 2, Iss 2, Pp 204-215 (2016)
Penelitian ini menghasilkan Aplikasi kerangka tubuh manusia yang perancangannya dalam bentuk tiga dimensi (3D) dan pada penelitian ini menampilkan tulang – tulang manusia dari kepala, badan dan anggota gerak. Aplikasi ini digunakan untuk sarana pen
Externí odkaz:
https://doaj.org/article/4e4f8b18e4564eac87d0c3cfc96abae1