The following pages link to Philippe Mahey (Q227668):
Displaying 41 items.
- Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem (Q295887) (← links)
- Single string planning problem arising in liner shipping industries: a heuristic approach (Q336521) (← links)
- Decomposition methods for a spatial model for long-term energy pricing problem (Q522102) (← links)
- Hub-and-spoke network design and fleet deployment for string planning of liner shipping (Q727347) (← links)
- (Q850823) (redirect page) (← links)
- Separable augmented Lagrangian algorithm with multidimensional scaling for monotropic programming (Q850824) (← links)
- Iterative improvement methods for a multiperiod network design problem (Q1303714) (← links)
- Bounds for global optimization of capacity expansion and flow assignment problems (Q1591547) (← links)
- Variable neighborhood descent with iterated local search for routing and wavelength assignment (Q1761137) (← links)
- Minimum convex piecewise linear cost tension problem on quasi-\(k\) series-parallel graphs (Q1775289) (← links)
- Multicommodity network expansion under elastic demands (Q1863858) (← links)
- A minimum mean cycle cancelling method for nonlinear multicommodity flow problems (Q1972012) (← links)
- Separable diagonalized multiplier method for decomposition nonlinear programs (Q2381876) (← links)
- Accelerating convergence of a class of splitting algorithms with iterative foldings (Q2390719) (← links)
- Local optimality conditions for multicommodity flow problems with separable piecewise convex costs (Q2643798) (← links)
- (Q2752468) (← links)
- Separable convexification and DCA techniques for capacity and flow assignment problems (Q2773173) (← links)
- A survey on operator splitting and decomposition of convex programs (Q2969955) (← links)
- <i>k</i> -Splittable delay constrained routing problem: A branch-and-price approach (Q3057130) (← links)
- A Survey of Algorithms for Convex Multicommodity Flow Problems (Q3116724) (← links)
- (Q3303383) (← links)
- Multicommodity flow problems with a bounded number of paths: A flow deviation approach (Q3418124) (← links)
- (Q3730342) (← links)
- Méthodes de décomposition et décentralisation en programmation linéaire (Q3748064) (← links)
- Using linear programming in Petri net analysis (Q3826378) (← links)
- (Q4362982) (← links)
- Packet Routing in Telecommunication Networks with Path and Flow Restrictions (Q4427375) (← links)
- (Q4495133) (← links)
- A new proximal decomposition algorithm for routing in telecommunication networks (Q4542490) (← links)
- Partial regularization of the sum of two maximal monotone operators (Q4694996) (← links)
- (Q4739664) (← links)
- Moving asymptotes and active set strategy for constrained optimization design in magnetostatic problems (Q4835168) (← links)
- Proximal Decomposition on the Graph of a Maximal Monotone Operator (Q4838965) (← links)
- (Q4872800) (← links)
- Editorial. A case of plagiarism: retraction of a paper by Sreenivas and Srinivas, Vol. 43, n°4, pp. 331–337 (Q5189877) (← links)
- (Q5294050) (← links)
- Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs (Q5449668) (← links)
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1 (Q5479828) (← links)
- Capacity and flow assignment of data networks by generalized Benders decomposition (Q5954665) (← links)
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (Q6070422) (← links)
- Inertial-relaxed splitting for composite monotone inclusions (Q6114897) (← links)
