Sciweavers

2976 search results - page 55 / 596
» On the bounded integer programming
Sort
View
SIAMDM
2010
105views more  SIAMDM 2010»
13 years 4 months ago
Minimal Inequalities for an Infinite Relaxation of Integer Programs
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
Amitabh Basu, Michele Conforti, Gérard Corn...
CAEPIA
2011
Springer
12 years 10 months ago
Solving Sequential Mixed Auctions with Integer Programming
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 ...
Boris Mikhaylov, Jesús Cerquides, Juan A. R...