Country: France

Found 511 papers in total
A note on Edmonds Q-matrices
A note on Edmonds Q-matrices
1997,
When we want to solve Linear Programming Problems with integer or rational entries,...
On alpha-flows
On alpha-flows
1997,
We take up ideas from Minoux. We point out that the algorithms he has proposed to...
Parallelization of a critical path algorithm on a computer with shared memory
Parallelization of a critical path algorithm on a computer with shared memory
1997,
In this paper, we consider parallelisation on a parallel computer with shared memory...
Global optimization based on genetic algorithms and evolution strategies
Global optimization based on genetic algorithms and evolution strategies
1997,
In this paper, a new algorithm for global optimization, based on genetic algorithms...
Cone convexity of measured set vector functions and vector optimization
Cone convexity of measured set vector functions and vector optimization
1997,
With the absence of a linear structure on a σ-algebra of sets, an accepted...
Principles and applications of tabu search methods
Principles and applications of tabu search methods
1997,
Among the new general heuristics developed over recent years in the field of...
Simulated annealing algorithm: Technical improvements
Simulated annealing algorithm: Technical improvements
1998,
We present an overview of the main problem-independent sequential and parallel...
A trust region method for zero–one nonlinear programming
A trust region method for zero–one nonlinear programming
1997,
An O( n log n ) trust region approximation method to solve 0–1 non-linear...
Solution of integer or mixed linear programs using the Hermite normal form
Solution of integer or mixed linear programs using the Hermite normal form
1997,
Integer Linear Programming (ILP) is especially hard when the solutions of its integral...
A heuristic column generation method for the heterogeneous fleet VRP
A heuristic column generation method for the heterogeneous fleet VRP
1999,
This paper presents a heuristic column generation method for solving vehicle routing...
Shortest path problems with time windows constraints: Application to vehicle routing
Shortest path problems with time windows constraints: Application to vehicle routing
1997,
We solve the time dependent shortest path problem. This problem consists in finding a...
A good approximation of the inventory level in a (Q,r) perishable inventory system
A good approximation of the inventory level in a (Q,r) perishable inventory system
1999,
This paper derives a good approach to approximating the expected inventory level per...
Determination of a robust economic period in the EOQ model
Determination of a robust economic period in the EOQ model
1999,
This paper presents results about the optimal order interval in a context of fuzzy...
On locating a single path-like facility in a general graph
On locating a single path-like facility in a general graph
1997,
The problem of locating a path-like facility of fixed length in a tree can be solved...
On the solution of a class of location problems. A sample problem
On the solution of a class of location problems. A sample problem
1998,
In Section 2 of this paper the optimality conditions for the EMFL (Euclidean...
Data aggregation for evaluating performances of FMS, using queueing networks
Data aggregation for evaluating performances of FMS, using queueing networks
1998,
This paper deals with the use of Queueing Network (QN) models for...
An optimal search strategy based on user preferences for choice oriented databases
An optimal search strategy based on user preferences for choice oriented databases
1998,
In many instances, when people search a database, they are searching for a best record...
Task decomposition for a bus multiprocessor: properties of optimal schedules
Task decomposition for a bus multiprocessor: properties of optimal schedules
1997,
A bus oriented multiprocessor contains one bus system to which all the processors are...
Solving scheduling problems using Petri nets and constraint logic programming
Solving scheduling problems using Petri nets and constraint logic programming
1998,
This paper presents an approach to solve scheduling problems from a Petri net model. A...
A new formulation for scheduling unrelated processor under precedence constraints
A new formulation for scheduling unrelated processor under precedence constraints
1999,
We give a new formulation for the problem of task scheduling into unrelated processors...
Hybrid flowshop problems: A survey
Hybrid flowshop problems: A survey
1999,
A special class of scheduling problems is studied in this paper, named Hybrid...
Temporal decomposition approach and characterisation of feasible solutions for the single machine scheduling problem
Temporal decomposition approach and characterisation of feasible solutions for the single machine scheduling problem
1999,
We propose a temporal decomposition approach for the one-machine scheduling problem...
On the application of insertion techniques for job shop problems with setup times
On the application of insertion techniques for job shop problems with setup times
1999,
Constructive heuristics for shop scheduling problems are often based on priority (or...
Approximation algorithms for integer covering problems via greedy column generation
Approximation algorithms for integer covering problems via greedy column generation
1994,
Many combinatorial problems can be formulated as covering problems. In some cases,...
Papers per page: