The following pages link to Walid Ben-Ameur (Q266023):
Displaying 50 items.
- Extended cuts (Q266025) (← links)
- (Q496698) (redirect page) (← links)
- Fractional routing using pairs of failure-disjoint paths (Q496701) (← links)
- A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems (Q643005) (← links)
- (Q716274) (redirect page) (← links)
- Virtual network provisioning across multiple substrate networks (Q716276) (← links)
- On the most imbalanced orientation of a graph (Q721946) (← links)
- Routing of uncertain traffic demands (Q833385) (← links)
- Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems (Q992570) (← links)
- A geometric characterization of ``optimality-equivalent'' relaxations (Q1016070) (← links)
- Complete formulations of polytopes related to extensions of assignment matrices (Q1662654) (← links)
- Convex and concave envelopes: revisited and new perspectives (Q1728297) (← links)
- A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines (Q1728470) (← links)
- Multipolar robust optimization (Q1731824) (← links)
- Design of fiber cable tree FTTH networks (Q1742231) (← links)
- Fiber cable network design in tree networks (Q1749517) (← links)
- A gradient-based randomised heuristic for the maximum cut problem (Q1758877) (← links)
- Computing the initial temperature of simulated annealing (Q1771224) (← links)
- On the approximability of robust network design (Q1998836) (← links)
- New bounds for subset selection from conic relaxations (Q2076815) (← links)
- On fractional cut covers (Q2312658) (← links)
- The \(k\)-separator problem: polyhedra, complexity and approximation results (Q2354313) (← links)
- A note on the problem of \(r\) disjoint \((s, t)\)-cuts and some related issues (Q2417161) (← links)
- A constraint generation algorithm for large scale linear programs using multiple-points separation (Q2492707) (← links)
- From Graph Orientation to the Unweighted Maximum Cut (Q2817879) (← links)
- A Full Description of Polytopes Related to the Index of the Lowest Nonzero Row of an Assignment Matrix (Q2835658) (← links)
- (Q2861517) (← links)
- (Q2861518) (← links)
- (Q2861519) (← links)
- (Q2861540) (← links)
- (Q2861541) (← links)
- On the minimum cut separator problem (Q2892143) (← links)
- Robust Distributed Consensus Using Total Variation (Q2980525) (← links)
- On the minimum cost multiple-source unsplittable flow problem (Q3004201) (← links)
- Designing Steiner Networks with Unicyclic Connected Components: An Easy Problem (Q3013146) (← links)
- (Q3059313) (← links)
- Robust routing and optimal partitioning of a traffic demand polytope (Q3087849) (← links)
- (Q3109946) (← links)
- On the Most Imbalanced Orientation of a Graph (Q3196369) (← links)
- Acceleration of cutting-plane and column generation algorithms: Applications to network design (Q3418117) (← links)
- New bounds for the maximum cut problem (Q3439502) (← links)
- Spectral bounds for the maximum cut problem (Q3632965) (← links)
- Internet Routing and Related Topology Issues (Q4443120) (← links)
- (Q4509380) (← links)
- Resource Optimization of Non-Additive Utility Functions in Localized SC-FDMA Systems (Q4579459) (← links)
- Efficient algorithms for the maximum concurrent flow problem (Q4642463) (← links)
- Multi-hour design of survivable classical IP networks (Q4790688) (← links)
- Some recent contributions to network optimization (Q4812397) (← links)
- The k-Separator Problem (Q4925250) (← links)
- Minimum‐weight subgraphs with unicyclic components and a lower‐bounded girth (Q5326798) (← links)
