The following pages link to Ioannis T. Christou (Q336526):
Displayed 17 items.
- A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem (Q336528) (← links)
- (Q1373753) (redirect page) (← links)
- Minimum-perimeter domain assignment (Q1373754) (← links)
- (Q1754065) (redirect page) (← links)
- The discrete-time EOQ model: solution and implications (Q1754067) (← links)
- Optimal \((r,nQ,T)\) batch ordering with quantized supplies (Q1761971) (← links)
- Optimal equi-partition of rectangular domains for parallel computation (Q1923785) (← links)
- A hierarchical system for effective coordination of available-to-promise logic mechanisms (Q3055457) (← links)
- (Q4215366) (← links)
- (Q4251075) (← links)
- (Q4801582) (← links)
- A new hybrid parallel genetic algorithm for the job‐shop scheduling problem (Q4980005) (← links)
- Quantitative Methods in Supply Chain Management (Q5198515) (← links)
- Global optimization of two-echelon serial chains with replenishment costs (Q5382717) (← links)
- SuperTrust (Q5401471) (← links)
- SuperTrust – A Secure and Efficient Framework for Handling Trust in Super Peer Networks (Q5445775) (← links)
- Optimal (<i>r</i>, <i>nQ</i>, <i>T</i>) batch-ordering policy under stationary demand (Q5497458) (← links)