Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: combinatorial optimization
Found
3184 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Trivial Cases for the Kantorovitch Problem
2000,
Dubuc Serge
Let X and Y be two compact spaces endowed with respective measures μ and ν...
Planification des Emplois du Temps et de la Formation au Sein d'une Grande Entreprise
2000,
Hertz Alain
We describe an O.R. technique which plans the allotment of time of the collaborators...
The Variance Location Problem on a Network with Continuously distributed demand
2000,
Mesa Juan A
Most location problems on networks consider discrete nodal demand. However, for many...
Bi‐directional nearness in a network by AHP (Analytic Hierarchy Process) and ANP (Analytic Network Process)
2000,
Nishizawa Kazutomo
In this paper we study bi‐directional nearness in a network based on AHP...
Scheduling in the presence of processor networks : complexity and approximation
2012,
Knig Jean-Claude
In this paper, we study the problem of makespan minimization for the multiprocessor...
A polarized adaptive schedule generation scheme for the resource‐constrained project scheduling problem
2012,
Zamani Reza
This paper presents a hybrid schedule generation scheme for solving the...
A hybrid genetic algorithm for the vehicle routing problem with three‐dimensional loading constraints
2012,
Miao Lixin
This paper addresses a Three‐Dimensional Loading Capacitated Vehicle Routing...
Branch‐and‐bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
2012,
Haouari Mohamed
This paper deals with the parallel‐machine scheduling problem with the aim of...
A study on the budget constrained facility location model considering inventory management cost
2012,
Jin Hyun-Woong
One of the important issues on the distribution network design is to incorporate...
On a dual network exterior point simplex type algorithm and its computational behavior
2012,
Paparrizos Konstantinos
The minimum cost network flow problem, (MCNFP) constitutes a wide category of network...
Interactive compromise hypersphere method and its applications
2012,
Sitarz Sebastian
The paper focuses on multi‐criteria problems. It presents the interactive...
Analysis of a MX/G(a,b)/1 queueing system with vacation interruption
2012,
Arumuganathan R
In this paper, a batch arrival general bulk service queueing system with interrupted...
A heuristic column generation method for the heterogeneous fleet VRP
1999,
Taillard E D
This paper presents a heuristic column generation method for solving vehicle routing...
On the hierarchy of functioning rules in distributed computing
1999,
Bui A
In previous papers, we used a Markovian model to determine the optimal functioning...
Contrôle dynamique de flux dans un système d'attente avec panne
1999,
Haqiq A
We consider two parallel M/M/1 queues. The server at one of the queues is subject to...
A new formulation for scheduling unrelated processor under precedence constraints
1999,
Maculan Nelson
We give a new formulation for the problem of task scheduling into unrelated processors...
Automatic run‐time choice for simulation length in mimesis
1999,
Becker M
This paper presents an algorithm which prevents a simulation user from choosing a...
Integer preemptive scheduling on parallel machines
2012,
Sviridenko M
We consider preemptive machine scheduling problems on identical parallel machines. It...
Simple linear time approximation algorithm for betweenness
2012,
Makarychev Yury
We study the Betweenness problem. We are given a set of vertices and betweenness...
The battery switching station scheduling problem
2012,
Raviv Tal
A battery switching station (BSS) provides a service that enables extending the...
Separating tight metric inequalities by bilevel programming
2012,
Mattia Sara
We present the first exact approach to separate tight metric inequalities for the...
A maritime inventory routing problem: Practical approach
2013,
Song Jin-Hwa
Despite of the practicality of the motivation of the inventory routing problem (IRP),...
Aircrew pairings with possible repetitions of the same flight number
2013,
Soumis Franois
A crew pairing is a sequence of flights, connections and rests that starts and ends at...
Solving a robust airline crew pairing problem with column generation
2013,
Blbl Kerem
In this study, we solve a robust version of the airline crew pairing problem. Our...
First Page
82
83
84
85
86
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers