The following pages link to Marco Di Summa (Q314057):
Displaying 37 items.
- The swap graph of the finite soluble groups (Q314059) (← links)
- A branch-price-and-cut algorithm for the minimum evolution problem (Q319451) (← links)
- Complexity of the critical node problem over trees (Q547128) (← links)
- On a class of mixed-integer sets with a single integer variable (Q614040) (← links)
- Reverse split rank (Q896287) (← links)
- Lot-sizing on a tree (Q924877) (← links)
- A short convex-hull proof for the all-different system with the inclusion property (Q1785324) (← links)
- Extreme functions with an arbitrary number of slopes (Q1801005) (← links)
- Branch and cut algorithms for detecting critical nodes in undirected graphs (Q1935569) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899) (← links)
- Piecewise smooth extreme functions are piecewise linear (Q2288193) (← links)
- An extreme function which is nonnegative and discontinuous everywhere (Q2288200) (← links)
- Balas formulation for the union of polytopes is optimal (Q2297650) (← links)
- A geometric approach to cut-generating functions (Q2349120) (← links)
- The structure of the infinite models in integer programming (Q2401145) (← links)
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth (Q2444525) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
- Maximal $S$-Free Convex Sets and the Helly Number (Q2835843) (← links)
- On the Convergence of the Affine Hull of the Chvátal--Gomory Closures (Q2870517) (← links)
- Lot-Sizing with Stock Upper Bounds and Fixed Charges (Q3008012) (← links)
- Erratum: Lot-Sizing with Stock Upper Bounds and Fixed Charges (Q3094941) (← links)
- Network Formulations of Mixed-Integer Programs (Q3169026) (← links)
- Mixing Sets Linked by Bidirected Paths (Q3225243) (← links)
- Reverse Chvátal--Gomory Rank (Q3453572) (← links)
- The Mixing Set with Flows (Q3503224) (← links)
- The Mixing Set with Divisible Capacities (Q3503864) (← links)
- Optimal Cutting Planes from the Group Relaxations (Q5108238) (← links)
- Split Cuts in the Plane (Q5147031) (← links)
- On largest volume simplices and sub-determinants (Q5362979) (← links)
- Minimally Infeasible Set-Partitioning Problems with Balanced Constraints (Q5388043) (← links)
- Reverse Split Rank (Q5418999) (← links)
- The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows (Q5429279) (← links)
- On sub-determinants and the diameter of polyhedra (Q5891422) (← links)
- Critical node/edge detection problems on trees (Q6054014) (← links)
- Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective (Q6057717) (← links)
- Towards Lower Bounds on the Depth of ReLU Neural Networks (Q6100606) (← links)
- The role of rationality in integer-programming relaxations (Q6126664) (← links)
