<--- Back to Details
First PageDocument Content
Operations research / Mathematics / Computational complexity theory / Applied mathematics / Mathematical optimization / Heuristic / Integer programming / Relaxation / Branch and bound / Combinatorial optimization / Travelling salesman problem / Algorithm
Date: 2013-09-27 05:04:48
Operations research
Mathematics
Computational complexity theory
Applied mathematics
Mathematical optimization
Heuristic
Integer programming
Relaxation
Branch and bound
Combinatorial optimization
Travelling salesman problem
Algorithm

Microsoft Word - orbs7180.doc

Add to Reading List

Source URL: www.math.hkbu.edu.hk

Download Document from Source Website

File Size: 12,56 KB

Share Document on Facebook

Similar Documents

Mathematics / Applied mathematics / Statistical randomness / Theoretical computer science / Packing problems / Dynamic programming / Machine learning algorithms / Machine learning / Reinforcement learning / Bin packing problem / Artificial neural network / Algorithm

arXiv:1807.01672v2 [cs.LG] 6 JulRanked Reward: Enabling Self-Play Reinforcement Learning for Combinatorial Optimization Alexandre Laterre

DocID: 1xTSz - View Document

APPROX 2012 and RANDOM 2012 15th Intl. Workshop on Approx. Algorithms for Combinatorial Optimization Problems - APPROX 2012 & 16th Intl. Workshop on Randomization and Computation - RANDOM 2012 http://cui.unige.ch/tcs/ran

DocID: 1vegv - View Document

⋆ Combinatorial Optimization (Oberwolfach, November 9–15, Discrete DC Programming by Discrete Convex Analysis —Use of Conjugacy— Kazuo Murota (U. Tokyo)

DocID: 1uRbH - View Document

Research Summary∗ Chandra Nair Overview In my early research career I considered random versions of combinatorial optimization problems; my doctoral thesis [17] resolved a long-standing conjecture about the assignment

DocID: 1uvqi - View Document

In silico optimization of a guava antimicrobial peptide enables combinatorial exploration for peptide design

DocID: 1u55o - View Document