Results 141 to 150 of about 16,981 (186)

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 in selecting appropriate train routes and schedules for minimizing the propagation of delay in case of traffic perturbation.
Raffaele Pesenti, Paola Pellegrini, Joaquin Rodriguez   +2 more
exaly   +6 more sources

Some of the next articles are maybe not open access.

Related searches:

Conditional TMDTO as a MILP Instance

IEEE Transactions on Information Theory, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Satyam Kumar 0002, Santanu Sarkar 0001
openaire   +2 more sources

Symmetry breaking in MILP formulations for Unit Commitment problems [PDF]

Computers and Chemical Engineering, 2016
This paper addresses the study of symmetry in Unit Commitment (UC) problems solved by Mixed Integer Linear Programming (MILP) formulations, and using Linear Programming based Branch & Bound MILP solvers.
Ricardo Lima, Augusto Q. Novais
exaly   +2 more sources

MPILS: An Automatic Tuner for MILP Solvers

Computers & Operations Research, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ilyas Himmich, El Mehdi Er Raqabi, Nizar El Hachemi, Issmail El Hallaoui, Abdelmoutalib Metrane, François Soumis   +5 more
openaire   +4 more sources

Analysis of MILP Techniques for the Pooling Problem

Operations Research, 2015
The 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   +3 more sources

A MILP model for N-dimensional allocation

Computers & Chemical Engineering, 2007
This 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, Lazaros G. Papageorgiou, Tapio Westerlund   +2 more
openaire   +2 more sources

Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems

INFORMS Journal on Computing, 2001
The goal of this paper is to develop models and methods that use complementary strengths of Mixed Integer Linear Programming (MILP) and Constraint Programming (CP) techniques to solve problems that are otherwise intractable if solved using either of the ...
Ignacio Grossmann
exaly   +1 more source

A global MILP model for FMS scheduling

European Journal of Operational Research, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liu, JY, MacCarthy, BL
openaire   +2 more sources

Comparative evaluation of MILP flowshop models

Journal of the Operational Research Society, 2005
Summary: 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., Fan T. Tseng, Jatinder N. D. Gupta   +2 more
openaire   +3 more sources

The MILP Road to MIQCP

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