<--- Back to Details
First PageDocument Content
Mathematics / Mathematical optimization / Computational complexity theory / Combinatorial optimization / Travelling salesman problem / Cutting-plane method / Decomposition method / Linear programming / COIN-OR / Ear decomposition
Date: 2016-03-26 12:56:26
Mathematics
Mathematical optimization
Computational complexity theory
Combinatorial optimization
Travelling salesman problem
Cutting-plane method
Decomposition method
Linear programming
COIN-OR
Ear decomposition

DECOMPOSITION METHODS FOR INTEGER LINEAR PROGRAMMING by Matthew Galati

Add to Reading List

Source URL: coral.ie.lehigh.edu

Download Document from Source Website

File Size: 1,27 MB

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