8647 search results - page 115 / 1730 » The Container Selection Problem |
138
click to vote
MOR
2010
15 years 1 months ago
2010
We extend the work of Letchford (2000) by introducing a new class of valid inequalities for the traveling salesman problem, called the generalized domino-parity (GDP) constraints....
143
click to vote
ICTAI
2009
IEEE
15 years 21 days ago
2009
IEEE
This paper describes a noise-aware dominance operator for evolutionary algorithms to solve the multiobjective optimization problems (MOPs) that contain noise in their objective fu...
102
click to vote
CDC
2008
IEEE
15 years 9 months ago
2008
IEEE
— In this paper, we study the Dynamic Traveling Repairman Problem (DTRP) for dynamic systems. In the DTRP, customers are arising dynamically and randomly in a bounded region R, a...
119
click to vote
CPM
2004
Springer
15 years 8 months ago
2004
Springer
For a set of rooted, unordered, distinctly leaf-labeled trees, the NP-hard maximum agreement subtree problem (MAST) asks for a tree contained (up to isomorphism or homeomorphism) i...
111
click to vote
AAAI
2004
15 years 4 months ago
2004
Over-constrained problems can have an exponential number of conflicts, which explain the failure, and an exponential number of relaxations, which restore the consistency. A user o...