<--- Back to Details
First PageDocument Content
NP-complete problems / Operations research / Combinatorial optimization / Linear programming / Travelling salesman problem / Linear programming relaxation / Relaxation / Graph / Shortest path problem / Theoretical computer science / Mathematics / Graph theory
Date: 2014-04-18 21:30:54
NP-complete problems
Operations research
Combinatorial optimization
Linear programming
Travelling salesman problem
Linear programming relaxation
Relaxation
Graph
Shortest path problem
Theoretical computer science
Mathematics
Graph theory

Lift-and-Project Integrality Gaps for the Traveling Salesperson Problem

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Download Document from Source Website

File Size: 463,05 KB

Share Document on Facebook

Similar Documents

Economy / Statistical theory / Time series models / Probability and statistics / Machine learning / Alternative currencies / Cryptocurrencies / Digital currencies / BoxJenkins method / Forecasting / Bitcoin / Cross-validation

Trading Bitcoin and Online Time Series Prediction Muhammad J Amjad Operations Research Center

DocID: 1xVYr - View Document

Economy / Business / Supply chain management / Merchandising / Inventory optimization / Logistics / Lean manufacturing / Inventory / Retail / Warehouse / Operations management / Online shopping

Order Fulfillment in Online Retailing: What Goes Where by Ping Josephine Xu M.S. Operations Research

DocID: 1xVON - View Document

Data management / Computing / Information / Data / Database / Big data / Open data

The NYU Administrative Data Research Facility (ADRF) The data revolution is transforming how executives manage operations and businesses deliver goods and services. Yet when it comes to communities and the government ag

DocID: 1xTFQ - View Document

V ORträge zum Operations Research Kolloquium des Instituts für Operations Research Zeit: Donnerstag, 16. April 2015, 17:30 Uhr

DocID: 1vsb3 - View Document

V ORträge zum Operations Research Kolloquium des Instituts für Operations Research Zeit: Donnerstag, 22. Juni 2017, 17:30 Uhr

DocID: 1vomF - View Document