1054 search results - page 29 / 211 » Capacitated Domination Problem |
107
click to vote
EOR
2008
15 years 2 months ago
2008
We study the one-machine scheduling problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time...
134
Voted
AMEC
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Current auctions often expose bidding agents to two difficult, yet common, problems. First, bidding agents often have the opportunity to participate in successive auctio...
108
click to vote
ACL
2000
15 years 3 months ago
2000
Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we...
133
Voted
MP
2006
15 years 2 months ago
2006
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
108
click to vote
ASPDAC
2007
ACM
15 years 6 months ago
2007
ACM
As integrated circuits manufacturing technology is advancing into 65nm and 45nm nodes, extensive resolution enhancement techniques (RETs) are needed to correctly manufacture a chip...