Journal: Journal of Mathematical Modelling and Algorithms

Found 153 papers in total
Primal–dual interior-point algorithms for semidefinite optimization based on a simple kernel function
Primal–dual interior-point algorithms for semidefinite optimization based on a simple kernel function
2005,
Interior-point methods (IPMs) for semidefinite optimization (SDO) have been studied...
Effective measurement of network vulnerability under random and intentional attacks
Effective measurement of network vulnerability under random and intentional attacks
2005,
The study of the security and stability of complex networks plays a central role in...
Enhancements to two exact algorithms for solving the vertex P-center problem
Enhancements to two exact algorithms for solving the vertex P-center problem
2005,
Enhancements to two exact algorithms from the literature to solve the vertex P -center...
The linear ordering problem: instances, search space analysis and algorithms
The linear ordering problem: instances, search space analysis and algorithms
2004,
The linear ordering problem is an NP -hard problem that arises in a variety of...
The analysis of evolutionary algorithms on sorting and shortest paths problems
The analysis of evolutionary algorithms on sorting and shortest paths problems
2004,
The analysis of evolutionary algorithms is up to now limited to special classes of...
A No-Free-Lunch theorem for non-uniform distributions of target functions
A No-Free-Lunch theorem for non-uniform distributions of target functions
2004,
The sharpened No-Free-Lunch-theorem (NFL-theorem) states that, regardless of the...
Helper-objectives: Using multi-objective evolutionary algorithms for single-objective optimisation
Helper-objectives: Using multi-objective evolutionary algorithms for single-objective optimisation
2004,
This paper investigates the use of multi-objective methods to guide the search when...
Solving the probabilistic travelling salesperson problem with ant colony optimization
Solving the probabilistic travelling salesperson problem with ant colony optimization
2004,
In this paper, we describe new ways to apply Ant Colony Optimization (ACO) to the...
New models of the generalized minimum spanning tree problem
New models of the generalized minimum spanning tree problem
2004,
We consider a generalization of the Minimum Spanning Tree Problem, called the...
The attribute based hill climber
The attribute based hill climber
2004,
In this paper we introduce the Attribute Based Hill Climber, a parameter-free...
A meta-heuristic with orthogonal experiment for the set covering problem
A meta-heuristic with orthogonal experiment for the set covering problem
2004,
This paper reports an evolutionary meta-heuristic incorporating fuzzy evaluation for...
A scatter search method for the bi-criteria multi-dimensional {0,1}-knapsack problem using surrogate relaxation
A scatter search method for the bi-criteria multi-dimensional {0,1}-knapsack problem using surrogate relaxation
2004,
This paper presents a scatter search (SS) based method for the bi-criteria...
A multiobjective hybrid metaheuristic approach for a geographic information system-based spatial zoning model
A multiobjective hybrid metaheuristic approach for a geographic information system-based spatial zoning model
2004,
This paper presents a multiobjective hybrid metaheuristic approach for an intelligent...
Two-machine flow shop scheduling with nonregular criteria
Two-machine flow shop scheduling with nonregular criteria
2004,
We consider a two-machine flow shop problem with a common due date where the objective...
An ant colony optimization algorithm for shop scheduling problems
An ant colony optimization algorithm for shop scheduling problems
2004,
We deal with the application of ant colony optimization to group shop scheduling,...
Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
2004,
This paper deals with the Arc Routing Problem with Intermediate Facilities under...
A tabu search heuristic for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows
A tabu search heuristic for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows
2004,
The problem considered is the full-load pickup and delivery problem with time windows,...
Resource constrained shortest path problems in path planning for fleet management
Resource constrained shortest path problems in path planning for fleet management
2004,
In the management and control of a vehicle fleet on a road network, the problem arises...
On solving quickest time problems in time-dependent, dynamic networks
On solving quickest time problems in time-dependent, dynamic networks
2004,
In this paper, a pseudopolynomial time algorithm is presented for solving the integral...
Problems, models and complexity. Part I: Theory
Problems, models and complexity. Part I: Theory
2003,
The meaning of the term ‘problem’ in operations research (OR) deviates...
Problems, models and complexity. Part II: Application to the discrete lot-sizing and scheduling problem
Problems, models and complexity. Part II: Application to the discrete lot-sizing and scheduling problem
2003,
In Part I of this study, we suggest to identify an operations research (OR) problem...
A general approach for constraint solving by local search
A general approach for constraint solving by local search
2004,
In this paper, we present a general approach for solving constraint problems by local...
Four-day workweek scheduling with two or three consecutive days off
Four-day workweek scheduling with two or three consecutive days off
2003,
A four-day workweek days-off scheduling problem is considered. Out of the three days...
A branch-and-bound algorithm to solve a multi-level network optimization problem
A branch-and-bound algorithm to solve a multi-level network optimization problem
2003,
Multi-level network optimization problems arise in many contexts such as...
Papers per page: