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
A leader–follower game in competitive facility location
2012,
Aras Necati
We address the problem of locating new facilities of a firm or franchise that enters a...
An effective estimation of distribution algorithm for the multi‐mode resource‐constrained project scheduling problem
2012,
Wang Ling
In this paper, an estimation of distribution algorithm (EDA) is proposed to solve the...
A hierarchical algorithm for the planar single‐facility location routing problem
2012,
Torabi S A
Location routing problem (LRP) is an important logistical problem that comprises two...
A Neural Algorithm for the Maximum Clique Problem: Analysis, Experiments, and Circuit Implementation
2002,
Bertoni A
{In this paper we design and analyze a neural approximation algorithm for the Maximum...
Augmenting Trees to Meet Biconnectivity and Diameter Constraints
2002,
Chepoi V
Given a graph G=(V,E) and a positive integer D , we consider the problem of finding a...
Exploring Unknown Environments with Obstacles
2002,
Albers
We study exploration problems where a robot has to construct a complete map of an...
Optimal Time‐Critical Scheduling via Resource Augmentation
2002,
Phillips
We consider two fundamental problems in dynamic scheduling: scheduling to meet...
New Algorithms for Disk Scheduling
2002,
Andrews
Processor speed and memory capacity are increasing several times faster than disk...
Scheduling Independent Multiprocessor Tasks
2002,
Amoura
We study the problem of scheduling a set of n independent multiprocessor tasks with...
Minimum Congestion Redundant Assignments to Tolerate Random Faults
2002,
Fotakis
We consider the problem of computing minimum congestion, fault‐tolerant,...
Improved Algorithms for Uniform Partitions of Points
2002,
Agarwal
We consider the following one‐ and two‐dimensional bucketing problems:...
Linear‐Time Approximation Schemes for Scheduling Malleable Parallel Tasks
2002,
Jansen
A malleable parallel task is one whose execution time is a function of the number of...
An Online Algorithm for the Dynamic Maximal Dense Tree Problem
2002,
Awerbuch
The Online Maximal Dense Tree problem is as follows: given a weighted directed graph...
Distributed and On‐Line Routing on Tori
2002,
Yeh Tzuoo-Hawn
In this paper we study the problem of assigning paths to packets on N imes N tori in...
Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints
2002,
Shachnai
Modern computer systems distribute computation among several machines to speed up the...
The Analysis of Evolutionary Algorithms–A Proof That Crossover Really Can Help
2002,
Jansen
Evolutionary algorithms are randomized search heuristics that were invented in the...
A decomposition approach for facility location and relocation problem with uncertain number of future facilities
2012,
Lim Gino J
In this paper, we discuss two challenges of long term facility location problem that...
Fair resource allocation for different scenarios of demands
2012,
Sanlaville Eric
Here the problem is tackled by a multi‐criteria model, where one criterion is...
Reducing the number of cuts in generating three‐staged cutting patterns
2012,
Cui Yaodong
Three‐staged guillotine patterns are widely used in the manufacturing industry...
The impact of cost uncertainty on the location of a distribution center
2012,
Kim Seokjin
The location of a distribution center (DC) is a key consideration for the design of...
A complex discrete warm standby system with loss of units
2012,
Ruiz-Castro Juan Eloy
A redundant complex discrete system is modelled through phase type distributions. The...
Stability and monotonicity in newsvendor situations
2012,
Slikker Marco
This study considers a supply chain that consists of n retailers, each of them facing...
Importance of verifying queue model assumptions before planning with simulation software
2012,
Strang Kenneth David
This case study uses empirical data gathered at an Australian refinery to verify the...
On the exact calculation of the fill rate in a periodic review inventory policy under discrete demand patterns
2012,
Cards Manuel
The primary goal of this paper is the development of a generalized method to compute...
First Page
106
107
108
109
110
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers