Jump to ContentJump to Main Navigation

You are looking at 1-4 of 4 items

  • Keywords: integer linear programming x
Clear All Modify Search

View:

FURTHER ADVANCED TECHNIQUES

Rolf Niedermeier

in Invitation to Fixed-Parameter Algorithms

Published in print:
2006
Published Online:
September 2007
ISBN:
9780198566076
eISBN:
9780191713910
Item type:
chapter
Publisher:
Oxford University Press
DOI:
10.1093/acprof:oso/9780198566076.003.0011
Subject:
Mathematics, Combinatorics / Graph Theory / Discrete Mathematics

This chapter surveys further important techniques for designing fixed-parameter algorithms. These include color-coding, integer linear programming, iterative compression, greedy localization, and ... More


Optimization and Approximation

Cristopher Moore and Stephan Mertens

in The Nature of Computation

Published in print:
2011
Published Online:
December 2013
ISBN:
9780199233212
eISBN:
9780191775079
Item type:
chapter
Publisher:
Oxford University Press
DOI:
10.1093/acprof:oso/9780199233212.003.0009
Subject:
Physics, Theoretical, Computational, and Statistical Physics

This chapter focuses on the relationships between decision problems and their optimisation versions. It shows that, for most problems, the optimal solution can be realised in polynomial time if and ... More


Tractable Cases of the Winner Determination Problem

Rudolf Müller

in Combinatorial Auctions

Published in print:
2005
Published Online:
August 2013
ISBN:
9780262033428
eISBN:
9780262302920
Item type:
chapter
Publisher:
The MIT Press
DOI:
10.7551/mitpress/9780262033428.003.0014
Subject:
Society and Culture, Technology and Society

This chapter offers information on several approaches used for making the winner determination problem (WDP) solvable by putting restrictions on the bid prices. It begins with integer linear ... More


The Winner Determination Problem

Daniel Lehmann, Rudolf Müller, and Tuomas Sandholm

in Combinatorial Auctions

Published in print:
2005
Published Online:
August 2013
ISBN:
9780262033428
eISBN:
9780262302920
Item type:
chapter
Publisher:
The MIT Press
DOI:
10.7551/mitpress/9780262033428.003.0013
Subject:
Society and Culture, Technology and Society

This chapter defines and formulates a combinatorial optimization problem, called the winner determination problem, and examines its complexity properties. A range of alternative mathematical ... More


View: