The following pages link to Matteo Fischetti (Q181213):
Displaying 50 items.
- Improving branch-and-cut performance by random sampling (Q266414) (← links)
- Benders decomposition without separability: a computational study for capacitated facility location problems (Q323204) (← links)
- Branching on nonchimerical fractionalities (Q439902) (← links)
- Boosting the feasibility pump (Q495939) (← links)
- Proximity search for 0--1 mixed-integer convex programming (Q524882) (← links)
- On the separation of disjunctive cuts (Q543404) (← links)
- On the enumerative nature of Gomory's dual cutting plane method (Q607496) (← links)
- Lexicography and degeneracy: Can a pure cutting plane algorithm work? (Q647393) (← links)
- A hard integer program made easy by lexicography (Q715074) (← links)
- Mixed-integer cuts from cyclic groups (Q868450) (← links)
- Optimizing over the first Chvátal closure (Q877190) (← links)
- How tight is the corner relaxation? (Q951100) (← links)
- Feasibility pump 2.0 (Q1043854) (← links)
- Worst-case analysis of an approximation scheme for the subset-sum problem (Q1089266) (← links)
- A new dominance procedure for combinatorial optimization problems (Q1109683) (← links)
- Facets of two Steiner arborescence polyhedra (Q1181904) (← links)
- An additive bounding procedure for the asymmetric travelling salesman problem (Q1184344) (← links)
- Clique tree inequalities define facets of the asymmetric traveling salesman polytope (Q1343150) (← links)
- Algorithms for railway crew management (Q1365052) (← links)
- On the monotonization of polyhedra (Q1373726) (← links)
- Local branching (Q1424277) (← links)
- Frequency assignment in mobile radio systems using branch-and-cut techniques (Q1569929) (← links)
- Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control (Q1572678) (← links)
- Deep neural networks and mixed integer linear optimization (Q1617390) (← links)
- Chasing first queens by integer programming (Q1626730) (← links)
- Least cost influence propagation in (social) networks (Q1650779) (← links)
- SelfSplit parallelization for mixed-integer linear programming (Q1652584) (← links)
- Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling (Q1695036) (← links)
- Thinning out Steiner trees: a node-based model for uniform edge costs (Q1699615) (← links)
- Fast training of support vector machines with Gaussian kernel (Q1751182) (← links)
- Mixed-integer linear programming heuristics for the prepack optimization problem (Q1751183) (← links)
- A dynamic reformulation heuristic for generalized interdiction problems (Q1754203) (← links)
- A relax-and-cut framework for Gomory mixed-integer cuts (Q1762453) (← links)
- Orbital shrinking: theory and applications (Q1786877) (← links)
- On the use of intersection cuts for bilevel optimization (Q1800991) (← links)
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts (Q1814791) (← links)
- A new linear storage, polynomial-time approximation scheme for the subset-sum problem (Q1822965) (← links)
- New lower bounds for the symmetric travelling salesman problem (Q1824572) (← links)
- Optimisation of the interconnecting network of a UMTS radio mobile telephone system (Q1869690) (← links)
- The precedence-constrained asymmetric traveling salesman polytope (Q1890926) (← links)
- On the separation of maximally violated mod-\(k\) cuts (Q1970294) (← links)
- A polyhedral approach to an integer multicommodity flow problem (Q1975361) (← links)
- An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem (Q2099500) (← links)
- Safe distancing in the time of COVID-19 (Q2171551) (← links)
- Mixed-integer programming models for nesting problems (Q2271127) (← links)
- A branch-and-cut algorithm for mixed-integer bilinear programming (Q2282539) (← links)
- A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets (Q2367914) (← links)
- MIPping closures: An instant survey (Q2373443) (← links)
- On handling indicator constraints in mixed integer programming (Q2374361) (← links)
- Cutting plane versus compact formulations for uncertain (integer) linear programs (Q2392865) (← links)
