EPSRC logo

Details of Grant 

EPSRC Reference: GR/L88795/01
Title: MINIMAL MOD-K CUTS FOR PACKING, COVERING AND PARTITIONING PROBLEMS
Principal Investigator: Eglese, Professor RW
Other Investigators:
Researcher Co-Investigators:
Project Partners:
Department: Management Science
Organisation: Lancaster University
Scheme: Standard Research (Pre-FEC)
Starts: 01 January 1998 Ends: 31 December 1999 Value (£): 66,875
EPSRC Research Topic Classifications:
Mathematical Aspects of OR
EPSRC Industrial Sector Classifications:
No relevance to Underpinning Sectors
Related Grants:
Panel History:  
Summary on Grant Application Form
Set packing, covering and partitioning problems are fundamental problems of graph theory and combinatorics, with many applications in industry and commerce. However, they are hard to solve and there is a strong need for faster and more robust solution techniques.One successful way of tackling hard combinatorial optimisation problems is to use linear programming augmented by specialised cutting-planes. Recently, a new class of cutting-planes, called mod-k cuts, were proposed. There are good reasons to believe that mod-k cuts will be especially effective when applied to packing, covering and partitioning problems. The research will involve a theoretical and empirical study of the effectiveness of mod-k cuts for these problems, along with various methods for identifying and possibly strengthening the,.
Key Findings
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
Potential use in non-academic contexts
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
Impacts
Description This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
Summary
Date Materialised
Sectors submitted by the Researcher
This information can now be found on Gateway to Research (GtR) http://gtr.rcuk.ac.uk
Project URL:  
Further Information:  
Organisation Website: http://www.lancs.ac.uk