The following pages link to RAIRO. Operations Research (Q6550845):
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)
- Generalized networks in a random environment (Q2713144) (← links)
- Ranking BBTOPSIS based on intervals of relative proximities with qualification of preferences (Q2713145) (← links)
- Tabu search method for multiprocessor scheduling with communication delays (Q2713147) (← links)
- Bottleneck capacity expansion problems with general budget constraints (Q2765595) (← links)
- The Lorenz transform approach to the optimal repair-cost limit replacement policy with imperfect repair (Q2765597) (← links)
- Optimal and near-optimal \((s,S)\) 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_n\)-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 \(X\)-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 \(\mathrm{Geo}/\mathrm{Geo}/1\) queue with delayed multiple vacations (Q2798121) (← links)
- Complexity analysis of a weighted-full-Newton step interior-point algorithm for \(P_*(\kappa)\)-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 \textit{Ad hoc} 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)
