default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRAIRO - Operations Research, Volume 35
Volume 35, Number 1, January 2001
- Rainer E. Burkard, Bettina Klinz, Jianzhong Zhang:
Bottleneck Capacity Expansion Problems with General Budget Constraints. 1-20 - Tadashi Dohi, F. S. Othman, Naoto Kaio
, Shunji Osaki:
The Lorenz Transform approach to the Optimal Repair-Cost limit remplacement Policy with Imperfect Repair. 21-36 - Robin O. Roundy, Gennady Samorodnitsky:
Optimal and Near-Optimal ( s, S) Inventory Policies for Levy Demand Processes. 37-70 - Valery S. Gordon, Frank Werner, O. A. Yanushkevich:
Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals. 71-83 - J. Maublanc, D. Peyrton, Alain Quilliot:
Multiple Routing Strategies in a Labelled Network. 85-106 - Philippe Baptiste, Antoine Jouglet:
On Minimizing Total Tardiness in a Serial Batching Problem. 107-115 - Xiaoguang Yang:
Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem. 117-126 - Jozef Kratica, Dusan Tosic, Vladimir Filipovic, Ivana Ljubic:
Solving the simple plant location problem by genetic algorithm. 127-142
Volume 35, Number 2, April 2001
- Vincent T'kindt, Jean-Charles Billaut:
Multicriteria scheduling problems: a survey. 143-163 - Philippe Chrétienne:
Minimizing the Earliness and Tardiness Cost of a Sequence of Tasks on a Single Machine. 165-187 - Patrice Boizumault, Philippe David, Housni Djellab:
Resource allocation in a mobile telephone network: A constructive repair algorithm. 189-209 - Philippe Meurdesoif, Benoît Rottembourg:
Semi-Definite positive Programming Relaxations for Graph Kn-Coloring in Frequency Assignment. 211-228 - Roberta Jungblut-Hessel, Brigitte Plateau, William J. Stewart, Bernard Ycart:
Fast simulation for Road Traffic Network. 229-250 - Saïd Hanafi, Arnaud Fréville:
Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List. 251-267 - P. Mahey, Thai Q. Phong, Henrique Pacca Loureiro Luna:
Separable convexification and DCA techniques for capacity and flow assignment problems. 269-281 - Alain Guénoche, Bruno Leclerc:
The triangles method to build X-trees from incomplete distance matrices. 283-300
Volume 35, Number 3, July 2001
- Jacques A. Ferland, Pina Marziliano:
Efficient and Local Efficient Solutions for Assignment Type Problems. 301-313 - Emilio Carrizosa, Eduardo Conde, Antonia Castaño, Dolores Romero Morales:
Finding the principal points of a random variable. 315-328 - Gérard Berthiau, Patrick Siarry:
État de l'art des méthodes "d'optimisation globale". 329-365 - Fatiha Bendali, Jean Mailfert, Alain Quilliot:
Tarification par des jeux Coopératifs avec Demandes Élastiques. 367-381
Volume 35, Number 4, October 2001
- Marcia Fampa, Nelson Maculan:
A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ. 383-394 - Djamel Benterki, Bachir Merikhi:
A modified algorithm for the strict feasibility problem. 395-399 - Philippe Michelon, Stéphanie Ripeau, Nelson Maculan:
Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée. 401-414 - Michel Vasquez, Jin-Kao Hao:
Une approche hybride pour le sac à dos multidimensionnel en variables 0-1. 415-438 - Moussa Larbani, Rabia Nessah:
Sur l'équilibre fort selon Berge. 439-451
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-31 22:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
