The following pages link to Mohamed Haouari (Q177048):
Displaying 50 items.
- Optimization models for a single-plant district cooling system (Q320055) (← links)
- An assignment-based lower bound for a class of two-machine flow shop problems (Q336351) (← links)
- Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles (Q336550) (← links)
- An optimization-based heuristic for the machine reassignment problem (Q338859) (← links)
- A preemptive bound for the resource constrained project scheduling problem (Q398922) (← links)
- The Steiner tree problem with delays: a compact formulation and reduction procedures (Q496653) (← links)
- Relaxations and exact solution of the variable sized bin packing problem (Q535302) (← links)
- Exact approaches for integrated aircraft fleeting and routing at TunisAir (Q540645) (← links)
- Bounding strategies for the hybrid flow shop scheduling problem (Q545969) (← links)
- Lower bounds for scheduling on identical parallel machines with heads and tails (Q596460) (← links)
- Exact methods for the robotic cell problem (Q656059) (← links)
- Upper and lower bounding strategies for the generalized minimum spanning tree problem (Q817552) (← links)
- Energetic reasoning revisited: Application to parallel machine scheduling (Q835610) (← links)
- Optimal scheduling of a two-stage hybrid flow shop (Q857819) (← links)
- Supplier selection and order lot sizing modeling: a review (Q883555) (← links)
- Network flow-based approaches for integrated aircraft fleeting and routing (Q958106) (← links)
- Discrepancy search for the flexible job shop scheduling problem (Q991381) (← links)
- Robust scheduling and robustness measures for the discrete time/cost trade-off problem (Q992657) (← links)
- Heuristics for the variable sized bin-packing problem (Q1017465) (← links)
- Approximation algorithms for single machine scheduling with one unavailability period (Q1022445) (← links)
- Maximizing the minimum completion time on parallel machines (Q1029565) (← links)
- Discrete time/cost trade-off problem: a decomposition-based solution algorithm for the budget version (Q1040964) (← links)
- An optimization-based heuristic for the robotic cell problem (Q1040983) (← links)
- Heuristic algorithms for the two-stage hybrid flowshop problem (Q1371955) (← links)
- (Q1579494) (redirect page) (← links)
- Generalized spanning trees (Q1579496) (← links)
- Generalized Steiner problems and other variants (Q1592840) (← links)
- Minimizing makespan on parallel machines subject to release dates and delivery times (Q1607981) (← links)
- A hybrid simulation-optimization approach for the robust discrete time/cost trade-off problem (Q1636886) (← links)
- A matheuristic for the asymmetric capacitated vehicle routing problem (Q1686058) (← links)
- Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems (Q1694814) (← links)
- Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem (Q1762094) (← links)
- Optimal parallel machines scheduling with availability constraints (Q1775061) (← links)
- A computational study of the permutation flow shop problem based on a tight lower bound (Q1777158) (← links)
- An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines (Q1870003) (← links)
- A branch-and-cut algorithm for the Steiner tree problem with delays (Q1926621) (← links)
- Tight compact models and comparative analysis for the prize collecting Steiner tree problem (Q1941390) (← links)
- Algorithmic expedients for the prize collecting Steiner tree problem (Q1952504) (← links)
- Solving a large-scale integrated fleet assignment and crew pairing problem (Q2399331) (← links)
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
- An approximate decomposition algorithm for scheduling on parallel machines with heads and tails (Q2433392) (← links)
- A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture (Q2442084) (← links)
- Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements (Q2468776) (← links)
- A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem (Q2496025) (← links)
- Optimal solution of the discrete cost multicommodity network design problem (Q2518654) (← links)
- Fast lifting procedures for the bin packing problem (Q2581316) (← links)
- A matheuristic for the robust integrated airline fleet assignment, aircraft routing, and crew pairing problem (Q2669651) (← links)
- Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations (Q2830959) (← links)
- Exact Solution Methods for a Generalized Assignment Problem with Location/Allocation Considerations (Q2830960) (← links)
- (Q2861494) (← links)
