Commission strategy of the auction house

DOI10.1007/BF02836653MaRDI QIDQ5492500zbMATH OpenFDO

Authors

Publication date 13 October 2006

Published in Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

zbMATH Keywords

integer programming problemdual gapprimal and dual algorithmGomory's cutting plane

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Integer programming (90C10)

Recommendations

• On the enumerative nature of Gomory's dual cutting plane method
• A bounded dual (all-integer) integer programming algorithm with an objective cut
• The mixed cutting plane algorithm for all-integer programming
• Construction and selection for Gomory cutting plane
• One modification of Gomory's algorithm

Cites work

• A Theory of Auctions and Competitive Bidding
• Auctions for Oil and Gas Leases with an Informed Bidder and a Random Reservation Price

Cited in

(1)

• Research about the construction of Gomory constraint in cutting plane method

This page was built for publication: Commission strategy of the auction house

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5492500)