The following pages link to Stefano Gualandi (Q323213):
Displaying 33 items.
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
- (Q496637) (redirect page) (← links)
- On minimum reload cost cycle cover (Q496639) (← links)
- The balanced academic curriculum problem revisited (Q519088) (← links)
- A simple branching scheme for vertex coloring problems (Q765355) (← links)
- Enhancing CP-based column generation for integer programs (Q1041402) (← links)
- Handling preferences in student-project allocation (Q1730741) (← links)
- Primal heuristics for Wasserstein barycenters (Q2110411) (← links)
- Size distribution of cities: a kinetic explanation (Q2159097) (← links)
- A SAT encoding to compute aperiodic tiling rhythmic canons (Q2170172) (← links)
- The maximum nearby flow problem (Q2215997) (← links)
- Computing Wasserstein barycenters via linear programming (Q2327264) (← links)
- A Lagrangian propagator for artificial neural networks in constraint programming (Q2398510) (← links)
- Coordinated cutting plane generation via multi-objective separation (Q2436641) (← links)
- The equivalence of Fourier-based and Wasserstein metrics on imaging problems (Q2658509) (← links)
- Total coloring and total matching: polyhedra and facets (Q2673562) (← links)
- Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation (Q2815431) (← links)
- On Minimum Reload Cost Cycle Cover (Q2883554) (← links)
- On Minimum Changeover Cost Arborescences (Q3005849) (← links)
- Solving a resource allocation problem in wireless mesh networks: A comparison between a CP-based and a classical column generation (Q3057149) (← links)
- Computational experience with a SDP-based algorithm for maximum cut with limited unbalance (Q3057151) (← links)
- k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach (Q3630154) (← links)
- (Q4580188) (← links)
- A branch‐and‐price approach to <i>k</i>‐clustering minimum biclique completion problem (Q4921257) (← links)
- Call center service times are lognormal: A Fokker–Planck description (Q4961318) (← links)
- Human behavior and lognormal distribution. A kinetic description (Q4972952) (← links)
- Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming (Q5086003) (← links)
- On the Computation of Kantorovich--Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows (Q5124004) (← links)
- Constraint programming-based column generation (Q5902286) (← links)
- Constraint programming-based column generation (Q5919991) (← links)
- A kinetic description of the body size distribution of species (Q6157832) (← links)
- The Fourier discrepancy function (Q6171062) (← links)
- On the generation of metric TSP instances with a large integrality gap by branch-and-cut (Q6175708) (← links)
