699 search results - page 19 / 140 » The method of combinatorial telescoping |
EOR
2002
15 years 8 days ago
2002
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approxima...
110
click to vote
AAAI
2010
15 years 1 months ago
2010
We present the design and analysis of an approximately incentive-compatible combinatorial auction. In just a single run, the auction is able to extract enough value information fr...
124
click to vote
SODA
2008
ACM
15 years 1 months ago
2008
ACM
Bisubmodular functions are a natural "directed", or "signed", extension of submodular functions with several applications. Recently Fujishige and Iwata showed ...
97
Voted
CATS
2006
15 years 1 months ago
2006
Some combinatorial generation problems can be broken into subproblems for which loopless algorithms already exist. We discuss means by which loopless algorithms can be fused to pr...
84
Voted
EJC
2010
15 years 16 days ago
2010
We introduce the idea of Assur graphs, a concept originally developed and exclusively employed in the literature of the kinematics community. The paper translates the terminology,...