The following pages link to RAIRO - Operations Research (Q2713139):
Displaying 50 items.
- Simulation of transient performance measures for stiff markov chains (Q2713140) (← links)
- Continuous time linear-fractional programming. The minimum-risk approach (Q2713142) (← links)
- Second order optimality conditions for differentiable multiobjective problems (Q2713143) (← links)
- G-Réseaux dans un environnement aléatoire (Q2713144) (← links)
- Rangements BBTOPSIS fondés sur des intervalles de proximités relatives avec qualification des préférences (Q2713145) (← links)
- Une méthode tabou pour l'ordonnancement multiprocesseur avec délais de communication (Q2713147) (← links)
- Bottleneck Capacity Expansion Problems with General Budget Constraints (Q2765595) (← links)
- The Lorenz Transform approach to the Optimal Repair-Cost limit remplacement Policy with Imperfect Repair (Q2765597) (← links)
- Optimal and Near-Optimal (<i>s,S</i>) Inventory Policies for Levy Demand Processes (Q2765598) (← links)
- Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals (Q2765599) (← links)
- Multiple Routing Strategies in a Labelled Network (Q2765602) (← links)
- On Minimizing Total Tardiness in a Serial Batching Problem (Q2765603) (← links)
- Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem (Q2765604) (← links)
- Solving the simple plant location problem by genetic algorithm (Q2765605) (← links)
- Multicriteria scheduling problems: a survey (Q2773166) (← links)
- Minimizing the Earliness and Tardiness Cost of a Sequence of Tasks on a Single Machine (Q2773167) (← links)
- Resource allocation in a mobile telephone network: A constructive repair algorithm (Q2773168) (← links)
- Semi-Definite positive Programming Relaxations for Graph K<sub>n</sub>-Coloring in Frequency Assignment (Q2773169) (← links)
- Fast simulation for Road Traffic Network (Q2773171) (← links)
- Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List (Q2773172) (← links)
- Separable convexification and DCA techniques for capacity and flow assignment problems (Q2773173) (← links)
- The triangles method to build<i>X</i>-trees from incomplete distance matrices (Q2773174) (← links)
- A jointly constrained bilinear programming method for solving generalized Cournot–Pareto models (Q2798106) (← links)
- Inventory policy for deteriorating seasonal products with price and ramp-type time dependent demand (Q2798108) (← links)
- Ranking units and determining dominance relations in the cost efficiency analysis (Q2798109) (← links)
- Deregulated electricity markets with thermal losses and production bounds: models and optimality conditions (Q2798110) (← links)
- The Prize-collecting Call Control Problem on Weighted Lines and Rings (Q2798111) (← links)
- A Partheno-Genetic Algorithm for Dynamic 0-1 Multidimensional Knapsack Problem (Q2798113) (← links)
- Analysis of Discrete-time queues with correlated arrivals, negative customers and server interruption (Q2798114) (← links)
- Metaheuristics to solve a tasks scheduling problem in parallel identical machines with unavailability periods (Q2798117) (← links)
- A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting (Q2798120) (← links)
- Equilibrium balking strategies in the observable Geo/Geo/1 queue with delayed multiple vacations (Q2798121) (← links)
- Complexity analysis of a weighted-full-Newton step interior-point algorithm for<i>P</i><sub>∗</sub>(<i>κ</i>)-LCP (Q2798122) (← links)
- Optimal Control Policy of an Inventory System with Postponed Demand (Q2798123) (← links)
- A geometric perspective of the Weiszfeld algorithm for solving the Fermat−Weber problem (Q2798126) (← links)
- Competitive Analysis of Collection Behavior between Retailer and Third-Party in the Reverse Channel (Q2798127) (← links)
- A novel analytical integer optimization method for wavelet based subband coding (Q2798128) (← links)
- A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times (Q2798129) (← links)
- Two machines flow shop with reentrance and exact time lag (Q2805477) (← links)
- Generalization of the total outer-connected domination in graphs (Q2805478) (← links)
- Generalized Hypertree Decomposition for solving non binary CSP with compressed table constraints (Q2805480) (← links)
- Combined neighborhood tabu search for community detection in complex networks (Q2805482) (← links)
- Security modeling of an<i>ad hoc</i>network under the constraint of energy by an approach in two steps: Clustering-Evolutionary game (Q2805485) (← links)
- A numerical optimal control method for solving a large thermic process (Q2805487) (← links)
- Linear time algorithms to solve the linear ordering problem for oriented tree based graphs (Q2805488) (← links)
- Recent Advances in Operations Research in Computational Biology, Bioinformatics and Medicine (Q2805489) (← links)
- Algorithmic approaches for the single individual haplotyping problem (Q2805490) (← links)
- Progress in Nuclear Vector Replacement for NMR Protein Structure-Based Assignments (Q2805494) (← links)
- Structural and energetic comparison of the complexes of aminoglycosides with the model of the ribosomal A-site (Q2805497) (← links)
- Milp-hyperbox classification for structure-based drug design in the discovery of small molecule inhibitors of SIRTUIN6 (Q2805500) (← links)
