The following pages link to Eric Gourdin (Q496704):
Displaying 23 items.
- The location-dispatching problem: polyhedral results and content delivery network design (Q496706) (← links)
- A branch-and-cut algorithm for the partitioning-hub location-routing problem (Q709201) (← links)
- Design of survivable IP-over-optical networks (Q863570) (← links)
- (Q1342903) (redirect page) (← links)
- Finding maximum likelihood estimators for the three-parameter Weibull distribution (Q1342904) (← links)
- A branch and cut algorithm for hub location problems with single assignment (Q1771311) (← links)
- Global optimization of Hölder functions (Q1918982) (← links)
- An approximation algorithm for the maximum spectral subgraph problem (Q2082202) (← links)
- Relaxation and matrix randomized rounding for the maximum spectral subgraph problem (Q2327107) (← links)
- A study on load-balanced variants of the bin packing problem (Q2422735) (← links)
- Biclique completion problems for multicast network design (Q2427696) (← links)
- Multi-period capacitated location with modular equipments (Q2456628) (← links)
- Benders decomposition for a node-capacitated virtual network function placement and routing problem (Q2668658) (← links)
- (Q2861504) (← links)
- A Mixed Integer Model for the Sparsest Cut problem (Q2883559) (← links)
- (Q3147665) (← links)
- Optimization of OSPF Routing in IP Networks (Q3404471) (← links)
- Global Optimization Decomposition Methods for Bounded Parameter Minimax Risk Evaluation (Q4287918) (← links)
- Internet Routing and Related Topology Issues (Q4443120) (← links)
- The Uncapacitated Facility Location Problem with Client Matching (Q4530658) (← links)
- Efficient algorithms for the maximum concurrent flow problem (Q4642463) (← links)
- (Q4955459) (← links)
- Two extended formulations for the virtual network function placement and routing problem (Q6179721) (← links)
