Results 151 to 160 of about 3,912 (195)
Some of the next articles are maybe not open access.
Conditional TMDTO as a MILP Instance
IEEE Transactions on Information Theory, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Satyam Kumar 0002, Santanu Sarkar 0001
openaire +1 more source
MPILS: An Automatic Tuner for MILP Solvers
Computers & Operations Research, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ilyas Himmich +5 more
openaire +3 more sources
RECIFE-MILP: An Effective MILP-Based Heuristic for the Real-Time Railway Traffic Management Problem [PDF]
IEEE Transactions on Intelligent Transportation Systems, 2015 The real-time railway traffic management problem consists of selecting appropriate train routes and schedules for minimizing the propagation of delay in case of traffic perturbation. In this paper, we tackle this problem by introducing RECIFE-MILP, a heuristic algorithm based on a mixed-integer linear programming model.
Raffaele Pesenti +2 more
exaly +4 more sources
Analysis of MILP Techniques for the Pooling Problem
Operations Research, 2015The pq-relaxation for the pooling problem can be constructed by applying McCormick envelopes for each of the bilinear terms appearing in the so-called pq-formulation of the pooling problem. This relaxation can be strengthened by using piecewise-linear functions that over- and under-estimate each bilinear term. Although there is a significant amount of
Santanu S. Dey, Akshay Gupte
openaire +2 more sources
A MILP model for N-dimensional allocation
Computers & Chemical Engineering, 2007This paper presents a Mixed Integer Linear Programming (MILP) model for the solution of N-dimensional allocation problems. The applicability of the model is presented and demonstrated through some illustrative examples with different numbers of dimensions.
Joakim Westerlund +2 more
openaire +1 more source
Accelerated MILP-Strategies for the Optimal
2003In this paper a MILP-based opt imization algorithm for the optimaloperation planning of energy supply systems is presented. For this purpose, the maintasks of optimal operation planning are discussed and th e Priority-Based DynamicSearch Strategy (PBDSS) for the solution of the optimization problem is developed taking into account different ...
Peter Häcklander, Johannes F. Verstege
openaire +1 more source
2011
This paper surveys results on the NP-hard mixed-integer quadratically constrained programming problem. The focus is strong convex relaxations and valid inequalities, which can become the basis of efficient global techniques. In particular, we discuss relaxations and inequalities arising from the algebraic description of the problem as well as from ...
Samuel Burer, Anureet Saxena
openaire +1 more source
This paper surveys results on the NP-hard mixed-integer quadratically constrained programming problem. The focus is strong convex relaxations and valid inequalities, which can become the basis of efficient global techniques. In particular, we discuss relaxations and inequalities arising from the algebraic description of the problem as well as from ...
Samuel Burer, Anureet Saxena
openaire +1 more source
A global MILP model for FMS scheduling
European Journal of Operational Research, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liu, JY, MacCarthy, BL
openaire +2 more sources
MILP-Aided Cryptanalysis of the FUTURE Block Cipher
2023FUTURE is a recently proposed, lightweight block cipher. It has an AES-like, SP-based, 10-round encryption function, where, unlike most other lightweight constructions, the diffusion layer is based on an MDS matrix. Despite its relative complexity, it has a remarkable hardware performance due to careful design decisions.
İlter, M.B., Selçuk, Ali Aydın
openaire +3 more sources
Comparative evaluation of MILP flowshop models
Journal of the Operational Research Society, 2005Summary: This paper investigates the performance of two families of mixed-integer linear programing (MILP) models for solving the regular permutation flowshop problem to minimize makespan. The three models of the Wagner family incorporate the assignment problem while the five members of the Manne family use pairs of dichotomous constraints, or their ...
Edward F. Stafford Jr. +2 more
openaire +2 more sources