Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: programming: integer
Found
3058 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
On air traffic flow management with rerouting. Part I: Deterministic case
2012,
Escudero L F
In this paper a deterministic mixed 0–1 model for the air traffic flow...
On air traffic flow management with rerouting. Part II: Stochastic case
2012,
Escudero L F
We present a framework for modeling multistage mixed 0–1 problems for the air...
A systematic two phase approach for the nurse rostering problem
2012,
Housos Efthymios
Nurse rostering is an NP‐hard combinatorial problem which makes it extremely...
A mixed integer programming model for long term capacity expansion planning: A case study from The Hunter Valley Coal Chain
2012,
Sier David
The Hunter Valley Coal Chain is the largest coal export operation in the world with a...
A Constraint Programming model for fast optimal stowage of container vessel bays
2012,
Delgado Alberto
Container vessel stowage planning is a hard combinatorial optimization problem with...
New formulation and a branch‐and‐cut algorithm for the multiple allocation p‐hub median problem
2012,
Marn Alfredo
This article deals with the uncapacitated multiple allocation p ‐hub median...
Diophantine Quadratic Equation and Smith Normal Form Using Scaled Extended Integer Abaffy–Broyden–Spedicato Algorithms
2012,
Golpar-Raboky E
Classes of integer Abaffy–Broyden–Spedicato (ABS) methods have recently...
A Primal‐Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties
2012,
Xu Dachuan
We consider the facility location problem with submodular penalties (FLPSP),...
Retrospective optimization of mixed‐integer stochastic systems using dynamic simplex linear interpolation
2012,
Wang Honggang
We propose a family of retrospective optimization (RO) algorithms for optimizing...
Capacity allocation problem with random demands for the rail container carrier
2012,
Gao Ziyou
In this paper, we consider the formulation and heuristic algorithm for the capacity...
An Integer Linear Programming based heuristic for the Capacitated m‐Ring‐Star Problem
2012,
Toth Paolo
We address the Capacitated m‐Ring‐Star Problem in which the aim is to...
Kernel Search: An application to the index tracking problem
2012,
Speranza M G
In this paper we study the problem of replicating the performances of a stock market...
A coordinated location‐inventory model
2012,
Berman Oded
We consider a coordinated location‐inventory model where distribution centers...
Optimizing system resilience: A facility protection model with recovery time
2012,
OHanley Jesse R
Optimizing system resilience is concerned with the development of strategies to...
An incomplete m‐exchange algorithm for solving the large‐scale multi‐scenario knapsack problem
2012,
Thompson Jonathan
This paper introduces a fast heuristic based algorithm for the max–min...
A study on the effect of the asymmetry on real capacitated vehicle routing problems
2012,
Ruiz Rubn
Matrices with distances between pairs of locations are essential for solving vehicle...
A two‐stage tabu search algorithm with enhanced packing heuristics for the 3L‐CVRP and M3L‐CVRP
2012,
Lim Andrew
The Three‐Dimensional Loading Capacitated Vehicle Routing Problem...
Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
2012,
Valente Jorge M S
In this paper, we consider the single machine scheduling problem with weighted...
Scheduling Security Personnel for the Vancouver 2010 Winter Olympic Games
2012,
Kaluzny Bohdan L
The Vancouver 2010 Integrated Security Unit (V2010‐ISU) ensured security during...
Qualitative and quantitative data envelopment analysis with interval data
2012,
Inuiguchi Masahiro
In this paper, we investigate DEA with interval input‐output data. First we...
Consecutive Ones Matrices for Multi‐dimensional Orthogonal Packing Problems
2012,
Pcher Arnaud
The multi‐dimensional orthogonal packing problem (OPP) is a well studied...
An algorithm for finding a maximum t‐matching excluding complete partite subgraphs
2012,
Kobayashi Yusuke
For an integer t and a fixed graph H , we consider the problem of finding a maximum t...
How tight is the corner relaxation? Insights gained from the stable set problem
2012,
Cornujols Grard
The corner relaxation of a mixed‐integer linear program is a central concept in...
A hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem
2012,
Uchoa Eduardo
This paper deals with the Heterogeneous Fleet Vehicle Routing Problem (HFVRP). The...
First Page
14
15
16
17
18
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers