Sciweavers

699 search results - page 19 / 140
» The method of combinatorial telescoping
Sort
View
EOR
2002
125views more  EOR 2002»
13 years 8 months ago
Genetic local search for multi-objective combinatorial optimization
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...
Andrzej Jaszkiewicz
AAAI
2010
13 years 10 months ago
Stability and Incentive Compatibility in a Kernel-Based Combinatorial Auction
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...
Sébastien Lahaie
SODA
2008
ACM
75views Algorithms» more  SODA 2008»
13 years 9 months ago
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
Bisubmodular functions are a natural "directed", or "signed", extension of submodular functions with several applications. Recently Fujishige and Iwata showed ...
S. Thomas McCormick, Satoru Fujishige
CATS
2006
13 years 9 months ago
Combinatorial Generation by Fusing Loopless Algorithms
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...
Tadao Takaoka, Stephen Violich
EJC
2010
13 years 8 months ago
Combinatorial characterization of the Assur graphs from engineering
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,...
Brigitte Servatius, Offer Shai, Walter Whiteley