The following pages link to Fabio Furini (Q251094):
Displaying 48 items.
- Approximated perspective relaxations: a project and lift approach (Q263157) (← links)
- Lower bounding techniques for DSATUR-based branch and bound (Q325423) (← links)
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size (Q336416) (← links)
- A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size (Q439486) (← links)
- Exact weighted vertex coloring via branch-and-price (Q448972) (← links)
- Solving vertex coloring problems as maximum weight stable set problems (Q516805) (← links)
- Improved rolling horizon approaches to the aircraft sequencing problem (Q892901) (← links)
- An exact algorithm for the partition coloring problem (Q1651600) (← links)
- Exact approaches for the knapsack problem with setups (Q1652523) (← links)
- On the product knapsack problem (Q1653266) (← links)
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem (Q1683061) (← links)
- Benders decomposition for very large scale partial set covering and maximal covering location problems (Q1719620) (← links)
- Improving the approximated projected perspective reformulation by dual information (Q1728322) (← links)
- The maximum clique interdiction problem (Q1735171) (← links)
- ILP models and column generation for the minimum sum coloring problem (Q1742227) (← links)
- Decomposition and reformulation of integer linear programming problems. (Summary) (Q1936665) (← links)
- A branch-and-price algorithm for the minimum sum coloring problem (Q1983110) (← links)
- A new branch-and-bound algorithm for the maximum weighted clique problem (Q2002840) (← links)
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
- A branch-and-cut algorithm for the edge interdiction clique problem (Q2031072) (← links)
- A new branch-and-filter exact algorithm for binary constraint satisfaction problems (Q2077912) (← links)
- Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups (Q2080827) (← links)
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems (Q2097628) (← links)
- On the exact separation of cover inequalities of maximum-depth (Q2115307) (← links)
- On integer and bilevel formulations for the \(k\)-vertex cut problem (Q2195678) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- Theoretical and computational study of several linearisation techniques for binary quadratic problems (Q2288865) (← links)
- A note on selective line-graphs and partition colorings (Q2294381) (← links)
- A lexicographic pricer for the fractional bin packing problem (Q2294394) (← links)
- A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
- The vertex \(k\)-cut problem (Q2419357) (← links)
- A new branch-and-bound algorithm for the maximum edge-weighted clique problem (Q2424766) (← links)
- Automatic Dantzig-Wolfe reformulation of mixed integer programs (Q2515047) (← links)
- MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover (Q2835669) (← links)
- Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming (Q2960367) (← links)
- Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation (Q3009749) (← links)
- Aircraft Sequencing Problems via a Rolling Horizon Algorithm (Q3167632) (← links)
- State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting (Q3195337) (← links)
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem (Q3466782) (← links)
- An Improved DSATUR‐Based Branch‐and‐Bound Algorithm for the Vertex Coloring Problem (Q4565777) (← links)
- Generation of Antipodal Random Vectors With Prescribed Non-Stationary 2-nd Order Statistics (Q4579087) (← links)
- A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques (Q5085477) (← links)
- Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem (Q5106375) (← links)
- ILP and CP Formulations for the Lazy Bureaucrat Problem (Q5741471) (← links)
- Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation (Q5964827) (← links)
- A combinatorial flow-based formulation for temporal bin packing problems (Q6109803) (← links)
- CliSAT: a new exact algorithm for hard maximum clique problems (Q6167321) (← links)
- A Numerically Exact Algorithm for the Bin-Packing Problem (Q6202337) (← links)
