Journal: RAIRO Operations Research

Found 507 papers in total
Configuration of machining lines for mass production: a mixed approach
Configuration of machining lines for mass production: a mixed approach
2009,
This paper deals with the optimization of machining lines for mass production. Such a...
A new any-order schedule generation scheme for resource-constrained project scheduling
A new any-order schedule generation scheme for resource-constrained project scheduling
2009,
In this paper, a new schedule generation scheme for resource-constrained project...
How much do approximate derivatives hurt filter methods?
How much do approximate derivatives hurt filter methods?
2009,
In this paper, we examine the influence of approximate first and/or second derivatives...
Reformulations in Mathematical Programming: Definitions and Systematics
Reformulations in Mathematical Programming: Definitions and Systematics
2009,
A reformulation of a mathematical program is a formulation which shares some...
Hybrid optimisation with ant colony methods for the guillotine bin packing problem
Hybrid optimisation with ant colony methods for the guillotine bin packing problem
2009,
In this paper, we are interested in the guillotine bin packing problem...
Hamiltonicity in Partly claw-free graphs
Hamiltonicity in Partly claw-free graphs
2009,
Matthews and Sumner have proved that if G is a 2–connected claw–free graph...
An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function
An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function
2009,
The multiparametric 0–1–Integer Programming (0–1–IP) problem...
Heuristics for the m–Peripatetic Salesman Problem
Heuristics for the m–Peripatetic Salesman Problem
2009,
The m –Peripatetic Salesman Problem ( m –PSP) is defined on a undirected...
Locally bounded k-colorings of trees
Locally bounded k-colorings of trees
2009,
Given a tree T with n vertices, we show, by using a dynamic programming approach, that...
Machine Repair Problem in Production Systems with Spares and Server Vacations
Machine Repair Problem in Production Systems with Spares and Server Vacations
2009,
This paper studies the machine repair problem consisting of M operating machines with...
A branch-and-price-and-cut algorithm for the pattern minimization problem
A branch-and-price-and-cut algorithm for the pattern minimization problem
2008,
In cutting stock problems, after an optimal (minimal stock usage) cutting plan has...
Acyclic orientations with path constraints
Acyclic orientations with path constraints
2008,
Many well–known combinatorial optimization problems can be stated over the set...
Comparison of algorithms in graph partitioning
Comparison of algorithms in graph partitioning
2008,
We first describe four recent methods to cluster vertices of an undirected non...
Comparing imperfection ratio and imperfection index for graph classes
Comparing imperfection ratio and imperfection index for graph classes
2008,
Perfect graphs constitute a well–studied graph class with a rich structure,...
Three tabu search methods for the MI-FAP applied to 802.11 networks
Three tabu search methods for the MI-FAP applied to 802.11 networks
2008,
Wireless LAN using IEEE 802.11 networks are now widely deployed at home by residential...
On the Steiner 2-edge connected subgraph polytope
On the Steiner 2-edge connected subgraph polytope
2008,
In this paper, we study the Steiner 2–edge connected subgraph polytope. We...
On the convex hull of projective planes
On the convex hull of projective planes
2008,
We study the finite projective planes with linear programming models. We give a...
Polynomial time algorithms for two classes of subgraph problem
Polynomial time algorithms for two classes of subgraph problem
2008,
We design a O ( n 3 ) polynomial time algorithm for finding a ( k −1)–...
A note on the hardness results for the labeled perfect matching problems in bipartite graphs
A note on the hardness results for the labeled perfect matching problems in bipartite graphs
2008,
In this note, we strengthen the inapproximation bound of O(log n ) for the labeled...
Polyhedral reformulation of a scheduling problem and related theoretical results
Polyhedral reformulation of a scheduling problem and related theoretical results
2008,
We deal here with a scheduling problem GPPCSP ( Generalized Parallelism and Preemption...
Unified global optimality conditions for smooth minimization problems with mixed variables
Unified global optimality conditions for smooth minimization problems with mixed variables
2008,
In this paper we establish necessary as well as sufficient conditions for a given...
Enumerating the set of non-dominated vectors in multiple objective integer linear programming
Enumerating the set of non-dominated vectors in multiple objective integer linear programming
2008,
An algorithm for enumerating all nondominated vectors of multiple objective integer...
A new initialisation method for the transportation problem
A new initialisation method for the transportation problem
2008,
A new initialization method for the transportation problem is presented. It assigns...
The inverse maximum flow problem considering the l∞ norm
The inverse maximum flow problem considering the l∞ norm
2008,
The problem is to modify the capacities of the arcs from a network so that a given...
Papers per page: