The following pages link to Michele Monaci (Q266411):
Displaying 50 items.
- Improving branch-and-cut performance by random sampling (Q266414) (← links)
- Theoretical and computational results about optimality-based domain reductions (Q288410) (← links)
- Exact solution of the robust knapsack problem (Q336592) (← links)
- Models and algorithms for packing rectangles into the smallest square (Q342053) (← links)
- An approximation scheme for the two-stage, two-dimensional knapsack problem (Q429647) (← links)
- An exact approach for the vertex coloring problem (Q429677) (← links)
- Branching on nonchimerical fractionalities (Q439902) (← links)
- Proximity search for 0--1 mixed-integer convex programming (Q524882) (← links)
- (Q691401) (redirect page) (← links)
- Complexity and approximation of an area packing problem (Q691403) (← links)
- Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints (Q729798) (← links)
- Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem (Q819064) (← links)
- Packing into the smallest square: worst-case analysis of lower bounds (Q865748) (← links)
- How tight is the corner relaxation? (Q951100) (← links)
- Bidimensional packing by bilinear programming (Q1016113) (← links)
- An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem (Q1025258) (← links)
- Models and heuristic algorithms for a weighted vertex coloring problem (Q1038841) (← links)
- Integer linear programming models for 2-staged two-dimensional knapsack problems (Q1411613) (← links)
- Models and algorithms for a staff scheduling problem (Q1424308) (← links)
- Algorithms for packing and scheduling problems. (Abstract of thesis) (Q1429294) (← links)
- On the two-dimensional knapsack problem (Q1433651) (← links)
- Integer optimization with penalized fractional values: the knapsack case (Q1631508) (← links)
- Least cost influence propagation in (social) networks (Q1650779) (← links)
- Exact approaches for the knapsack problem with setups (Q1652523) (← links)
- SelfSplit parallelization for mixed-integer linear programming (Q1652584) (← links)
- On the product knapsack problem (Q1653266) (← 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)
- Minimum tiling of a rectangle by squares (Q1730580) (← links)
- Mixed-integer linear programming heuristics for the prepack optimization problem (Q1751183) (← links)
- A dynamic reformulation heuristic for generalized interdiction problems (Q1754203) (← links)
- Exact algorithms for the two-dimensional guillotine knapsack (Q1761943) (← links)
- On the use of intersection cuts for bilevel optimization (Q1800991) (← links)
- Two-dimensional packing problems: a survey (Q1847188) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- The assignment and loading transportation problem (Q2029276) (← links)
- \(K\)-adaptability in stochastic optimization (Q2097652) (← links)
- 2DPackLib: a two-dimensional cutting and packing library (Q2115308) (← links)
- Exact algorithms for the 0-1 time-bomb knapsack problem (Q2147139) (← links)
- A branch-and-cut algorithm for mixed-integer bilinear programming (Q2282539) (← links)
- On handling indicator constraints in mixed integer programming (Q2374361) (← links)
- Cutting plane versus compact formulations for uncertain (integer) linear programs (Q2392865) (← links)
- A Lagrangian heuristic algorithm for a real-world train timetabling problem (Q2489900) (← links)
- Lower and upper bounds for the non-linear generalized assignment problem (Q2664280) (← links)
- (Q2759903) (← links)
- An Exact Approach to the Strip-Packing Problem (Q2884561) (← links)
- A Set-Covering-Based Heuristic Approach for Bin-Packing Problems (Q2892273) (← links)
- A Metaheuristic Approach for the Vertex Coloring Problem (Q2901013) (← links)
- Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem (Q2901015) (← links)
- Backdoor Branching (Q3009762) (← links)
