Volume 8; Issue 2

Discrete Optimization

Volume 8; Issue 2
1

Information-theoretic approaches to branching in search

Year:
2011
Language:
english
File:
PDF, 258 KB
english, 2011
4

Generalized resolution search

Year:
2011
Language:
english
File:
PDF, 367 KB
english, 2011
5

Strengthening lattice-free cuts using non-negativity

Year:
2011
Language:
english
File:
PDF, 378 KB
english, 2011
9

Online variable-sized bin packing with conflicts

Year:
2011
Language:
english
File:
PDF, 286 KB
english, 2011
10

Quantum annealing of the graph coloring problem

Year:
2011
Language:
english
File:
PDF, 240 KB
english, 2011
11

On the linear relaxation of the -median problem

Year:
2011
Language:
english
File:
PDF, 567 KB
english, 2011
12

A Note on “Lot-sizing with fixed charges on stocks: The convex hull”

Year:
2011
Language:
english
File:
PDF, 228 KB
english, 2011
13

Editorial Board

Year:
2011
Language:
english
File:
PDF, 52 KB
english, 2011
14

An exact approach for the Vertex Coloring Problem

Year:
2011
Language:
english
File:
PDF, 458 KB
english, 2011
15

Upgrading edge-disjoint paths in a ring

Year:
2011
Language:
english
File:
PDF, 296 KB
english, 2011
16

An exact algorithm for the network pricing problem

Year:
2011
Language:
english
File:
PDF, 531 KB
english, 2011