NDLI: Algorithms based on lp relaxations for combinatorial optimization problems.

Please wait, while we are loading the content...

Algorithms based on lp relaxations for combinatorial optimization problems.

Content Provider	CiteSeerX
Researcher	Caprara, Alberto
Abstract	We survey the main results presented in the author's Ph.D Thesis [12], which addresses the use of Linear Programming (LP) relaxations within exact and heuristic algorithms for the solution of some Combinatorial Optimization (CO) problems arising from real-life applications. It is well known that CO problems admit several possible Integer LP (ILP) formulations, and the corresponding LP relaxations may provide bounds of quite different quality. In all cases considered in the thesis, the dimension of the formulations used, i.e., the number of constraints and/or variables, is so large to make a black-box use of an LP solver completely impractical. The main practical application of the work presented in the thesis is the design of the algorithmic part of the crew management system of the Italian railways. In particular, we deal with the effective solution of very large set covering and crew rostering problems. We also present novel methodologies and results which may have some impact in the solution of a wide spectrum of practical problems, and effective exact algorithms for two important real-world CO problems, namely the problem of selecting the indexes to be constructed in a database and the problem of sorting a permutation by the minimum number of reversals, which has application in genome rearrangements.
File Format	PDF
Access Restriction	Open
Subject Keyword	Lp Relaxation Combinatorial Optimization Problem Large Set Covering Minimum Number Linear Programming Effective Exact Algorithm Black-box Use Crew Management System Corresponding Lp Relaxation Lp Solver Genome Rearrangement Several Possible Integer Lp Co Problem Different Quality Real-life Application Wide Spectrum Practical Problem Combinatorial Optimization Italian Railway Main Practical Application Crew Rostering Problem Important Real-world Co Problem Effective Solution Main Result Heuristic Algorithm Novel Methodology Algorithmic Part
Content Type	Text
Resource Type	Thesis

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in