The following pages link to Annals of Operations Research (Q59875):
Displaying 50 items.
- Pyramidal values (Q490156) (← links)
- Maximum weight archipelago subgraph problem (Q490157) (← links)
- Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence (Q490158) (← links)
- Structure of demand and consistent conjectural variations equilibrium (CCVE) in a mixed oligopoly model (Q490161) (← links)
- A noncooperative approach to bankruptcy problems with an endogenous estate (Q490162) (← links)
- Optimal processing rate and buffer size of a jump-diffusion processing system (Q490164) (← links)
- Pavement rehabilitation scheduling and toll pricing under different regulatory regimes (Q490166) (← links)
- A hybrid framework for optimizing beam angles in radiation therapy planning (Q490168) (← links)
- Restricted coloring problems on graphs with few \(P_4\)'s (Q490171) (← links)
- Analysis of inventory policies for perishable items with fixed leadtimes and lifetimes (Q490172) (← links)
- The optimal harvesting problem under price uncertainty (Q490173) (← links)
- On optimal bidding and inventory control in sequential procurement auctions: the multi period case (Q490174) (← links)
- A constructive heuristic for staff scheduling in the Glass industry (Q490177) (← links)
- Supply chain scheduling to minimize holding costs with outsourcing (Q490179) (← links)
- Modeling demand management strategies for evacuations (Q490182) (← links)
- On the ERM formulation and a stochastic approximation algorithm of the stochastic-\(R_0\) EVLCP (Q490183) (← links)
- Quantile-DEA classifiers with interval data (Q490184) (← links)
- Measuring the efficiency of NBA teams: additive efficiency decomposition in two-stage DEA (Q490188) (← links)
- General two-function topological minimax theorems (Q490190) (← links)
- An overview of \(\mathrm{ORP}^3\)-OR for young researchers and practitioners (Q490191) (← links)
- Modeling profit sharing in combinatorial exchanges by network flows (Q490193) (← links)
- On the optimal parking lot subscription policy problem: a hybrid simulation-optimization approach (Q490196) (← links)
- Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem (Q490197) (← links)
- A cost minimization heuristic for the pooling problem (Q490199) (← links)
- On modeling the air traffic control coordination in the collision avoidance problem by mixed integer linear optimization (Q490202) (← links)
- Nurse rostering at a Danish ward (Q490204) (← links)
- Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items (Q490206) (← links)
- Stable sets in one-seller assignment games (Q490208) (← links)
- A randomized granular tabu search heuristic for the split delivery vehicle routing problem (Q490211) (← links)
- Single-facility huff location problems on networks (Q490213) (← links)
- Regression tasks in machine learning via Fenchel duality (Q490215) (← links)
- Reformulation of a model for hierarchical divisive graph modularity maximization (Q490216) (← links)
- Optimal halting policies in Markov population decision chains with constant risk posture (Q490217) (← links)
- A column generation approach for multicast routing and wavelength assignment with delay constraints in heterogeneous WDM networks (Q490218) (← links)
- Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding (Q490221) (← links)
- Fast approximation algorithms for routing problems with hop-wise constraints (Q490222) (← links)
- Robust UAV mission planning (Q490224) (← links)
- Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum (Q490225) (← links)
- Evader interdiction: algorithms, complexity and collateral damage (Q490228) (← links)
- Value-at-Risk model for hazardous material transportation (Q490229) (← links)
- Modelling counter-intuitive effects on cost and air pollution from intermittent generation (Q490233) (← links)
- Tailored Lagrangian relaxation for the open pit block sequencing problem (Q490234) (← links)
- Locating optimal timetables and vehicle schedules in a transit line (Q490235) (← links)
- History-dependence in production-pollution-trade-off models: a multi-stage approach (Q490237) (← links)
- Solving multi-objective traffic assignment (Q490239) (← links)
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion (Q490241) (← links)
- On the multicriteria allocation problem (Q490242) (← links)
- Preprocessing for a map sectorization problem by means of mathematical programming (Q490244) (← links)
- Capacitated lot sizing problems with inventory bounds (Q492789) (← links)
- Preprocessing and an improved MIP model for examination timetabling (Q492792) (← links)
