The following pages link to José Neto (Q271648):
Displaying 32 items.
- On the diameter of cut polytopes (Q271649) (← links)
- On the polyhedral structure of uniform cut polytopes (Q401136) (← links)
- From equipartition to uniform cut polytopes: extended polyhedral results (Q533779) (← links)
- A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems (Q643005) (← links)
- On the most imbalanced orientation of a graph (Q721946) (← links)
- A polyhedral view to a generalization of multiple domination (Q832985) (← links)
- Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems (Q992570) (← links)
- A geometric characterization of ``optimality-equivalent'' relaxations (Q1016070) (← links)
- A polyhedral view to generalized multiple domination and limited packing (Q1661908) (← links)
- Complete formulations of polytopes related to extensions of assignment matrices (Q1662654) (← links)
- On total \(f\)-domination: polyhedral and algorithmic results (Q1732100) (← links)
- A gradient-based randomised heuristic for the maximum cut problem (Q1758877) (← links)
- A simple finite cutting plane algorithm for integer programs (Q1939718) (← links)
- New bounds for subset selection from conic relaxations (Q2076815) (← links)
- A class of spectral bounds for max \(k\)-cut (Q2181211) (← links)
- On \(f\)-domination: polyhedral and algorithmic results (Q2274147) (← links)
- On fractional cut covers (Q2312658) (← links)
- Spectral bounds for graph partitioning with prescribed partition sizes (Q2328109) (← links)
- The \(k\)-separator problem: polyhedra, complexity and approximation results (Q2354313) (← 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)
- (Q3059313) (← 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)
- Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems (Q3569819) (← links)
- Spectral bounds for the maximum cut problem (Q3632965) (← links)
- The k-Separator Problem (Q4925250) (← links)
- Asymmetry in the Complexity of the Multi-Commodity Network Pricing Problem (Q6508241) (← links)
- The no-meet matroid (Q6558676) (← links)
- The vesica piscis and the regular pentagon (Q6580330) (← links)
- Asymmetry in the complexity of the multi-commodity network pricing problem (Q6634531) (← links)
