1707 search results - page 40 / 342 » Early Integer Programming |
SIAMDM
2010
14 years 7 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
51
Voted
ACL
2011
14 years 4 months ago
2011
185
Voted
CAEPIA
2011
Springer
14 years 16 days 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 ...
79
Voted
EMNLP
2011
14 years 9 days ago
2011
187
Voted
CP
2009
Springer
16 years 1 months ago
2009
Springer
Millions of containers are stowed every week with goods worth billions of dollars, but container vessel stowage is an all but neglected combinatorial optimization problem. In this ...