The following pages link to Adriana F. Gabor (Q319384):
Displaying 19 items.
- An approximate policy for a dual-sourcing inventory model with positive lead times and binomial yield (Q319386) (← links)
- The vehicle rescheduling problem (Q336901) (← links)
- A tabu search algorithm for application placement in computer clustering (Q337070) (← links)
- An approximation algorithm for the \(k\)-level stochastic facility location problem (Q613331) (← links)
- How \(*\)not\(*\) to solve a sudoku (Q614048) (← links)
- (Q632691) (redirect page) (← links)
- Maximizing revenue with allocation of multiple advertisements on a Web banner (Q632692) (← links)
- Approximation algorithms for facility location problems with a special class of subadditive cost functions (Q860875) (← links)
- A new approximation algorithm for the multilevel facility location problem (Q968163) (← links)
- Waiting times in classical priority queues via elementary lattice path counting (Q1691914) (← links)
- A base-stock inventory model with service differentiation and response time guarantees (Q1749497) (← links)
- Erratum to: ``An approximation algorithm for the \(k\)-level stochastic facility location problem'' (Q2275586) (← links)
- Column generation based heuristic for learning classification trees (Q2289946) (← links)
- An approximation algorithm for a facility location problem with stochastic demands and inventories (Q2494818) (← links)
- An inventory model with discounts for omnichannel retailers of slow moving items (Q2670560) (← links)
- (Q3454075) (← links)
- Note on a Class of Admission Control Policies for the Stochastic Knapsack Problem (Q5434400) (← links)
- Optimal Joint Rate and Power Allocation in CDMA Networks (Q5434438) (← links)
- Simulation-based variable neighborhood search for optimizing skill assignments in multi-server facilities with inventories (Q6551153) (← links)
