The following pages link to Peter Värbrand (Q684335):
Displaying 24 items.
- Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach (Q684336) (← links)
- An augmented Lagrangian approach to multi-commodity flow problems with conversions (Q1077322) (← links)
- A global optimization approach for the linear two-level program (Q1207038) (← links)
- The traveling salesman game: An application of cost allocation in a gas and oil company (Q1270624) (← links)
- A quasiconcave minimization method for solving linear two-level programs (Q1318264) (← links)
- The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs (Q1804581) (← links)
- Optimized planning of frequency hopping in cellular networks (Q1886738) (← links)
- A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables (Q1919095) (← links)
- On the nucleolus of the basic vehicle routing game (Q1919815) (← links)
- Hoàng Tuy (7 December 1927 -- 14 July 2019) -- in appreciation (Q2225641) (← links)
- A solution approach for log truck scheduling based on composite pricing and branch and bound (Q3044067) (← links)
- A near-exact method for solving the log-truck scheduling problem (Q3158011) (← links)
- (Q3348687) (← links)
- (Q3348707) (← links)
- A hybrid algorithm for the generalized assignment problem (Q3348709) (← links)
- Decision support tools for ambulance dispatch and relocation (Q3590868) (← links)
- Strongly polynomial algorithm for a production-transportation problem with concave production cost (Q3835663) (← links)
- Relaxation techniques applied to some loading problems (Q4327925) (← links)
- A strong lower bound for the Node Weighted Steiner Tree Problem (Q4378524) (← links)
- (Q4494444) (← links)
- Strongly polynomial algorithm for two special minimum concave cost network flow problems (Q4764587) (← links)
- (Q4826163) (← links)
- On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem (Q5688010) (← links)
- (Q5692746) (← links)
