The following pages link to Alberto Caprara (Q181211):
Displayed 50 items.
- Theoretical and computational results about optimality-based domain reductions (Q288410) (← links)
- Improving a family of approximation algorithms to edge color multigraphs (Q293395) (← links)
- (Q336541) (redirect page) (← links)
- A new lower bound for curriculum-based course timetabling (Q336544) (← links)
- An approximation scheme for the two-stage, two-dimensional knapsack problem (Q429647) (← links)
- An effective branch-and-bound algorithm for convex quadratic integer programming (Q715081) (← links)
- Packing into the smallest square: worst-case analysis of lower bounds (Q865748) (← links)
- A column generation approach to train timetabling on a corridor (Q941001) (← links)
- Non-cyclic train timetabling and comparability graphs (Q974988) (← links)
- Bidimensional packing by bilinear programming (Q1016113) (← links)
- Modified subset sum heuristics for bin packing (Q1044695) (← links)
- Properties of some ILP formulations of a class of partitioning problems (Q1270767) (← links)
- Separating lifted odd-hole inequalities to solve the index selection problem (Q1304469) (← links)
- On the tightness of the alternating-cycle lower bound for sorting by reversals (Q1306396) (← links)
- On bandwidth-2 graphs (Q1348371) (← links)
- Algorithms for railway crew management (Q1365052) (← links)
- A 3/4-approximation algorithm for multiple subset sum (Q1402509) (← links)
- On the separation of split cuts and related inequalities (Q1411614) (← links)
- Worst-case analysis of the subset sum algorithm for bin packing. (Q1417595) (← links)
- Models and algorithms for a staff scheduling problem (Q1424308) (← links)
- On the two-dimensional knapsack problem (Q1433651) (← links)
- Approximation algorithms for knapsack problems with cardinality constraints (Q1569936) (← links)
- Improved approximation for breakpoint graph decomposition and sorting by reversals (Q1598878) (← links)
- A PTAS for the multiple subset sum problem with different knapsack capacities (Q1607031) (← links)
- Optimal linear arrangements using betweenness variables (Q1762457) (← links)
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts (Q1814791) (← links)
- A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem (Q1814816) (← links)
- On the stability number of the edge intersection of two graphs. (Q1853063) (← links)
- Packing triangles in bounded degree graphs. (Q1853132) (← links)
- Finding cliques of maximum weight on a generalization of permutation graphs (Q1940437) (← links)
- Global optimization problems and domain reduction strategies (Q1960192) (← links)
- On the separation of maximally violated mod-\(k\) cuts (Q1970294) (← links)
- Friendly bin packing instances without integer round-up property (Q2340275) (← links)
- On integer polytopes with few nonzero vertices (Q2376738) (← links)
- A Lagrangian heuristic for a train-unit assignment problem (Q2446297) (← links)
- Constrained 0-1 quadratic programming: basic approaches and extensions (Q2467302) (← links)
- A Lagrangian heuristic algorithm for a real-world train timetabling problem (Q2489900) (← links)
- Automatic Dantzig-Wolfe reformulation of mixed integer programs (Q2515047) (← links)
- A branch-and-cut algorithm for multiple sequence alignment (Q2583133) (← links)
- New techniques for cost sharing in combinatorial optimization games (Q2638367) (← links)
- Solving a real-world train-unit assignment problem (Q2638371) (← links)
- The Multiple Subset Sum Problem (Q2706330) (← links)
- (Q2759903) (← links)
- Modeling and Solving the Crew Rostering Problem (Q2781158) (← links)
- (Q2861498) (← links)
- Delay-Robust Event Scheduling (Q2875596) (← links)
- Sorting Permutations by Reversals Through Branch-and-Price (Q2884508) (← links)
- The Reversal Median Problem (Q2884551) (← links)
- Laying Out Sparse Graphs with Provably Minimum Bandwidth (Q2890478) (← links)
- Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study (Q2892331) (← links)