Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: heuristics: local search
Found
320 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Variable neighbourhood search for the minimum labelling Steiner tree problem
2009,
Darby-Dowman Kenneth
We present a study on heuristic solution approaches to the minimum labelling Steiner...
Neighborhood search heuristics for selecting hierarchically well‐formulated subsets in polynomial regression
2010,
Brusco Michael J
The importance of subset selection in multiple regression has been recognized for more...
A multiobjective metaheuristic for a mean-risk multistage capacity investment problem
2010,
Claro Joo
We propose a multiobjective local search metaheuristic for a mean-risk multistage...
A local search heuristic for bounded-degree minimum spanning trees
2008,
Zahrani M S
The bounded-degree minimum spanning tree (BDMST) problem has many practical...
A kriging based method for the solution of mixed-integer nonlinear programs containing black-box functions
2009,
Davis Eddie
In this paper a new methodology is developed for the solution of mixed–integer...
Primal-dual variable neighborhood search for the simple plant-location problem
2007,
Hansen Pierre
The variable neighborhood search metaheuristic is applied to the primal simple...
Asynchronous cooperative local search for the office-space-allocation problem
2007,
LandaSilva Dario
We investigate cooperative local search to improve upon known results of the...
Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
2007,
Laporte Gilbert
This paper addresses a variation of the traveling salesman problem with pickup and...
Very large-scale neighborhood search for the quadratic assignment problem
2007,
Sharma Dushyant
The quadratic assignment problem (QAP) consists of assigning n facilities to n...
A very large-scale neighborhood search algorithm for the combined through-fleet-assignment model
2007,
Sharma Dushyant
The fleet–assignment model (FAM) for an airline assigns fleet types to the set...
Multiple phase neighborhood Search-GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP
2009,
Migdalas Athanasios
In this paper, a new modified version of Greedy Randomized Adaptive Search Procedure...
Novel Local-Search-Based Approaches to University Examination Timetabling
2008,
Dell'Olmo Paolo
Examination timetabling assigns examinations to a given number of time slots so that...
Neighborhood search approaches to beam orientation optimization in intensity modulated radiation therapy treatment planning
2008,
Kumar Arvind
The intensity modulated radiation therapy (IMRT) treatment planning problem consists...
Solving real-life railroad blocking problems
2007,
Liu Jian
Each major US railroad ships millions of cars over its network annually. To reduce the...
Expanding neighborhood search – GRASP for the probabilistic traveling salesman problem
2008,
Pardalos Panos M.
The Probabilistic Traveling Salesman Problem is a variation of the classic traveling...
Models and methods for frequency assignment with cumulative interference constraints
2008,
Michelon Philippe
In this paper, a realistic modeling of interferences for frequency assignment in...
Categorical data fuzzy clustering: An analysis of local search heuristics
2008,
Benati Stefano
The fuzzy c partition of a set of qualitative data is the problem of selecting the...
Lagrangian bounds for just-in-time job-shop scheduling
2008,
Sourd Francis
We study the job-shop scheduling problem with earliness and tardiness penalties. We...
Power plant maintenance scheduling using ant colony optimization: an improved formulation
2008,
Maier Holger R.
It is common practice in the hydropower industry to either shorten the maintenance...
Heuristics for the mirrored traveling tournament problem
2007,
Ribeiro Celso C.
Professional sports leagues are a major economic activity around the world. Teams and...
Searching the k-change neighborhood for a traveling salesperson problem (TSP) is W[1]-hard
2008,
Marx Dniel
We show that searching the k -change neighborhood is W[1]-hard for metric TSP, which...
Scheduling periodic customer visits for a traveling salesperson
2007,
Hartl Richard F.
The problem considered in this paper deals with determining daily routes for a...
An exponential (matching based) neighborhood for the vehicle routing problem
2008,
Bampis Evripidis
We introduce an exponential neighborhood for the Vehicle Routing Problem with unit...
Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
2008,
Cui Yaodong
An approach is proposed for generating homogeneous three-staged cutting patterns for...
First Page
9
10
11
12
13
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers