The following pages link to Francisco Saldanha-da-Gama (Q287652):
Displaying 32 items.
- A two-stage stochastic transportation problem with fixed handling costs and a priori selection of the distribution channels (Q287653) (← links)
- Multi-product capacitated single-allocation hub location problems: formulations and inequalities (Q301056) (← links)
- (Q339629) (redirect page) (← links)
- Solving the job-shop scheduling problem optimally by dynamic programming (Q339631) (← links)
- Project scheduling with flexible resources: formulation and inequalities (Q443821) (← links)
- A note on ``Branch-and-price approach for the multi-skill project scheduling problem'' (Q497437) (← links)
- Multi-period hub network design problems with modular capacities (Q512995) (← links)
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method (Q526844) (← links)
- A stochastic bi-objective location model for strategic reverse logistics (Q611007) (← links)
- (Q651671) (redirect page) (← links)
- Hub and spoke network design with single-assignment, capacity decisions and balancing requirements (Q651672) (← links)
- Towards a stochastic programming modeling framework for districting (Q827113) (← links)
- The capacitated single-allocation hub location problem revisited: a note on a classical formulation (Q992581) (← links)
- A biased random-key genetic algorithm for the project scheduling problem with flexible resources (Q1667401) (← links)
- Time traps in supply chains: is optimal still good enough? (Q1681387) (← links)
- New algorithmic framework for conditional value at risk: application to stochastic fixed-charge transportation (Q1735183) (← links)
- Multi-period stochastic covering location problems: modeling framework and solution approach (Q1754338) (← links)
- Modeling the shelter site location problem using chance constraints: a case study for Istanbul (Q1754735) (← links)
- Multi-period reverse logistics network design (Q1926703) (← links)
- Modeling congestion and service time in hub location problems (Q2295119) (← links)
- Solving the variable size bin packing problem with discretized formulations (Q2462559) (← links)
- On the capacitated concentrator location problem: a reformulation by discretization (Q2496022) (← links)
- Discretized formulations for capacitated location problems with modular distribution costs (Q2655611) (← links)
- Robust Stochastic Facility Location: Sensitivity Analysis and Exact Solution (Q5058018) (← links)
- Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands (Q5131702) (← links)
- Comments on: ``Extensive facility location problems on networks: an updated review'' (Q5970232) (← links)
- Modeling frameworks for the multi‐skill resource‐constrained project scheduling problem: a theoretical and empirical comparison (Q6088125) (← links)
- Approximation schemes for districting problems with probabilistic constraints (Q6106979) (← links)
- Multi-period single-allocation hub location-routing: models and heuristic solutions (Q6113308) (← links)
- Multi-type maximal covering location problems: hybridizing discrete and continuous problems (Q6167323) (← links)
- Multi-period stochastic covering location problems: Modeling framework and solution approach (Q6525784) (← links)
- Correction to: ``Towards a stochastic programming modeling framework for districting'' (Q6597003) (← links)
