<--- Back to Details
First PageDocument Content
Operations research / Mathematical optimization / Computational complexity theory / Heuristics / NP-complete problems / Travelling salesman problem / Shortest path problem / Search algorithm / Bilevel program / Theoretical computer science / Applied mathematics / Mathematics
Date: 2008-07-30 07:44:48
Operations research
Mathematical optimization
Computational complexity theory
Heuristics
NP-complete problems
Travelling salesman problem
Shortest path problem
Search algorithm
Bilevel program
Theoretical computer science
Applied mathematics
Mathematics

CURRICULUM VITAE : NAME ADDRESS

Add to Reading List

Source URL: www.crt.umontreal.ca

Download Document from Source Website

File Size: 291,29 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