The following pages link to Matteo Fischetti (Q181213):
Displaying 50 items.
- Comments on: ``On learning and branching: a survey'' (Q2408516) (← links)
- Repairing MIP infeasibility through local branching (Q2459381) (← links)
- A feasibility pump heuristic for general mixed-integer problems (Q2471275) (← links)
- Projected Chvátal-Gomory cuts for mixed integer linear programs (Q2476991) (← links)
- The linear ordering problem with cumulative costs (Q2482806) (← links)
- New facets of the STS polytope generated from known facets of the ATS polytope (Q2494809) (← links)
- The feasibility pump (Q2571001) (← links)
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem (Q2583134) (← links)
- A new ILP-based refinement heuristic for vehicle routing problems (Q2583137) (← links)
- A note on the selection of Benders' cuts (Q2638375) (← links)
- Lifted cycle inequalities for the asymmetric traveling salesman problem (Q2757595) (← links)
- (Q2759914) (← links)
- Modeling and solving the crew rostering problem (Q2781158) (← links)
- On the knapsack closure of 0-1 integer linear programs (Q2861491) (← links)
- Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study (Q2892331) (← links)
- Pruning moves (Q2899042) (← links)
- Fast approaches to robust railway timetabling (Q2917367) (← links)
- Backdoor Branching (Q3009762) (← links)
- A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems (Q3114703) (← links)
- Solving the Cell Suppression Problem on Tabular Data with Linear Constraints (Q3114715) (← links)
- Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem (Q3134567) (← links)
- Three Ideas for the Quadratic Assignment Problem (Q3144407) (← links)
- A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem (Q3156821) (← links)
- Orbital Shrinking (Q3167611) (← links)
- Intersection Cuts for Bilevel Optimization (Q3186493) (← links)
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming (Q3392018) (← links)
- Can Pure Cutting Plane Algorithms Work? (Q3503863) (← links)
- A Relax-and-Cut Framework for Gomory’s Mixed-Integer Cuts (Q3569926) (← links)
- An In-Out Approach to Disjunctive Optimization (Q3569927) (← links)
- Mixed-Integer Cuts from Cyclic Groups (Q3596344) (← links)
- Optimizing over the First Chvàtal Closure (Q3596349) (← links)
- Modeling and Solving the Train Timetabling Problem (Q3635144) (← links)
- Light Robustness (Q3649159) (← links)
- Worst-case analysis of the differencing method for the partition problem (Q3750527) (← links)
- The Fixed Job Schedule Problem with Spread-Time Constraints (Q3779989) (← links)
- A branch and bound algorithm for the multiple depot vehicle scheduling problem (Q3826353) (← links)
- The Fixed Job Schedule Problem with Working-Time Constraints (Q3826354) (← links)
- An Additive Bounding Procedure for Combinatorial Optimization Problems (Q3832317) (← links)
- Facets of the Asymmetric Traveling Salesman Polytope (Q3971736) (← links)
- Approximation Algorithms for Fixed Job Schedule Problems (Q3990569) (← links)
- The Fixed-Outdegree 1-Arborescence Polytope (Q4027781) (← links)
- (Q4205235) (← links)
- (Q4234130) (← links)
- (Q4263704) (← links)
- An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs (Q4282274) (← links)
- The Delivery Man Problem and Cumulative Matroids (Q4285163) (← links)
- Weighted <i>k</i>‐cardinality trees: Complexity and polyhedral structure (Q4291481) (← links)
- A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs (Q4319767) (← links)
- A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem (Q4345574) (← links)
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem (Q4367232) (← links)
