158 search results - page 25 / 32 » Solving Sequential Mixed Auctions with Integer Programming |
CPAIOR
2010
Springer
13 years 11 months ago
2010
Springer
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
COR
2008
13 years 7 months ago
2008
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
EOR
2008
13 years 7 months ago
2008
Passengers travelling in public transportation networks often have to use different lines to cover the trip from their origin to the desired destination. As a consequence, the rel...
WABI
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Protein structural alignment is an indispensable tool used for many different studies in bioinformatics. Most structural alignment algorithms assume that the structural ...
AAAI
2000
13 years 9 months ago
2000
Models for sequential decision making under uncertainty (e.g., Markov decision processes,or MDPs) have beenstudied in operations research for decades. The recent incorporation of ...