The following pages link to Marcos Colebrook (Q853901):
Displayed 15 items.
- (Q336644) (redirect page) (← links)
- Effective replenishment policies for the multi-item dynamic lot-sizing problem with storage capacities (Q336647) (← links)
- Centralized and decentralized inventory policies for a single-vendor two-buyer system with permissible delay in payments (Q342486) (← links)
- Undesirable facility location problems on multicriteria networks (Q853902) (← links)
- A polynomial algorithm for the production/ordering planning problem with limited storage (Q856668) (← links)
- A polynomial algorithm for the multicriteria cent-dian location problem (Q864019) (← links)
- An \(O(mn)\) algorithm for the anti-cent-dian problem (Q864778) (← links)
- Optimality conditions in preference-based spanning tree problems (Q1027614) (← links)
- Locating a facility on a network with multiple median-type objectives (Q1290146) (← links)
- A biobjective Dijkstra algorithm (Q1728479) (← links)
- A new characterization for the dynamic lot size problem with bounded inventory (Q1869910) (← links)
- A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks (Q1885943) (← links)
- An efficient approach for solving the lot-sizing problem with time-varying storage capacities (Q2482746) (← links)
- (Q2704990) (← links)
- A new algorithm for the undesirable 1-center problem on networks (Q4656761) (← links)