817 search results - page 35 / 164 » Exact solutions to linear programming problems |
EOR
2007
13 years 8 months ago
2007
: In this paper, the RCPSP (Resource Constrained Project Scheduling Problem) is solved using a linear programming model. Each activity may or may not be preemptive. Each variable i...
AI
2005
Springer
13 years 8 months ago
2005
Springer
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
IOR
2006
13 years 8 months ago
2006
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
GECCO
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. Page-based Linear Genetic Programming (GP) is proposed and implemented with two-layer Subset Selection to address a two-class intrusion detection classification problem a...