1274 search results - page 37 / 255 » N-fold integer programming |
SIAMDM
2010
13 years 4 months ago
2010
We show that maximal S-free convex sets are polyhedra when S is the set of integral points in some rational polyhedron of Rn . This result extends a theorem of Lov
ACL
2011
13 years 1 months ago
2011
CAEPIA
2011
Springer
12 years 10 months ago
2011
Springer
Mixed multi-unit combinatorial auctions (MMUCAs) offer a high potential to be employed for the automated assembly of supply chains of agents. However, in order for mixed auctions ...
EMNLP
2011
12 years 9 months ago
2011
ESA
2006
Springer
14 years 1 months ago
2006
Springer
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...