Caprara Alberto

Alberto Caprara

Information about the author Alberto Caprara will soon be added to the site.
Found 33 papers in total
A heuristic method for the set covering problem
A heuristic method for the set covering problem
1999
We present a Lagrangian-based heuristic for the well-known Set Covering Problem (SCP)....
Approximation algorithms for knapsack problems with cardinality constraints
Approximation algorithms for knapsack problems with cardinality constraints
2000
We address a variant of the classical knapsack problem in which an upper bound is...
On the separation of maximally violated mod-k cuts
On the separation of maximally violated mod-k cuts
2000
Separation is of fundamental importance in cutting-plane based techniques for Integer...
Exact solution of the quadratic knapsack problem
Exact solution of the quadratic knapsack problem
1999
The Quadratic Knapsack Problem (QKP) calls for maximizing a quadratic objective...
Separating lifted odd-hole inequalitites to solve the index selection problem
Separating lifted odd-hole inequalitites to solve the index selection problem
1999
The Index Selection Problem (ISP) is a phase of fundamental importance in the physical...
Modeling and solving the crew rostering problem
Modeling and solving the crew rostering problem
1998
The Crew Rostering Problem (CRP) aims at determining an optimal sequencing of a given...
Algorithms for railway crew management
Algorithms for railway crew management
1997
Crew management is concerned with building the work schedules of crews needed to cover...
Odd cutsets, odd cycles and 0–1/2 Chvátal–Gomory cuts
Odd cutsets, odd cycles and 0–1/2 Chvátal–Gomory cuts
1996
We address 0–1/2 Chvátal–Gomory (C-G) cuts, a subclass of the...
{0, ½}-Chvátal–Gomory cuts
{0, ½}-Chvátal–Gomory cuts
1996
Given the integer polyhedron P I ≔ conv{x ∈ ℤ n : Ax ⩽ b} , where...
Papers per page: