Country: United States

Found 17049 papers in total
The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation, and Machine Learning
The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation, and Machine Learning
2006,
The distribution of order statistics for discrete random variables with applications to bootstrapping
The distribution of order statistics for discrete random variables with applications to bootstrapping
2006,
An algorithm for computing the PDF of order statistics drawn from discrete parent...
Solving the generalized assignment problem: An optimizing and heuristic approach
Solving the generalized assignment problem: An optimizing and heuristic approach
2003,
The classical generalized assignment problem (GAP) may be stated as finding a...
GRASP with path relinking for three-index assignment
GRASP with path relinking for three-index assignment
2005,
This paper proposes and tests variants of GRASP (greedy randomized adaptive search...
An exact approach to the Strip-Packing problem
An exact approach to the Strip-Packing problem
2003,
We consider the problem of orthogonally packing a given set of rectangular items into...
Early estimates of the size of branch-and-bound trees
Early estimates of the size of branch-and-bound trees
2006,
This paper intends to show that the time needed to solve mixed-integer-programming...
K-cuts: A variation of Gomory mixed integer cuts from the LP tableau
K-cuts: A variation of Gomory mixed integer cuts from the LP tableau
2003,
For an integer program, a k -cut is a cutting plane generated by the Gomory mixed...
Generating cutting planes for mixed integer programming problems in a parallel computing environment
Generating cutting planes for mixed integer programming problems in a parallel computing environment
2004,
A parallel implementation of a disjunctive cutting-plane algorithm in a distributed...
On bridging the gap between stochastic integer programming and MIP solver technologies
On bridging the gap between stochastic integer programming and MIP solver technologies
2004,
Stochastic integer programs (SIPs) represent a very difficult class of optimization...
A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
2005,
We consider an extension of the 0–1 multidimensional knapsack problem in which...
The analytic-center cutting-plane method for variational inequalities: A quadratic-cut approach
The analytic-center cutting-plane method for variational inequalities: A quadratic-cut approach
2005,
We introduce a cutting-plane, analytic-center algorithm for strongly monotone...
A column-generation approach to the multiple knapsack problem with color constraints
A column-generation approach to the multiple knapsack problem with color constraints
2006,
In this paper, we study a new problem that we refer to as the multiple knapsack with...
A metastrategy for large-scale resource management based on informational decomposition
A metastrategy for large-scale resource management based on informational decomposition
2006,
This paper addresses the solution of large, complex resource allocation problems,...
LPFML: A W3C XML Schema for linear and integer programming
LPFML: A W3C XML Schema for linear and integer programming
2005,
There are numerous modeling systems for generating linear programs and numerous...
Algorithms for the frame of a finitely generated unbounded polyhedron
Algorithms for the frame of a finitely generated unbounded polyhedron
2006,
Consider two finite sets 𝒜 and 𝒱 of points in m -dimensional space. The...
A set-covering-based heuristic approach for bin-packing problems
A set-covering-based heuristic approach for bin-packing problems
2006,
Several combinatorial optimization problems can be formulated as large set-covering...
Primal–dual-based algorithms for a directed network design problem
Primal–dual-based algorithms for a directed network design problem
2005,
We present efficient algorithms for a special case of network design problems, the...
The granular tabu search and its application to the vehicle-routing problem
The granular tabu search and its application to the vehicle-routing problem
2003,
We describe a new variant, called granular tabu search, of the well-known tabu-search...
A reactive variable neighborhood search for the vehicle-routing problem with time windows
A reactive variable neighborhood search for the vehicle-routing problem with time windows
2003,
The purpose of this paper is to present a new deterministic metaheuristic based on a...
Scheduling banner advertisements on the Web
Scheduling banner advertisements on the Web
2004,
Despite the slowdown in the economy, advertisement revenue remains a significant...
Specification and estimation of production functions involving damage control inputs: A two-stage, semiparametric approach
Specification and estimation of production functions involving damage control inputs: A two-stage, semiparametric approach
2006,
Productivity assessment of damage control inputs (such as pesticides) is complicated...
The constraint consensus method for finding approximately feasible points in nonlinear programs
The constraint consensus method for finding approximately feasible points in nonlinear programs
2004,
This paper develops a method for moving quickly and cheaply from an arbitrary initial...
A scheduling and capable-to-promise application for Swift & Company
A scheduling and capable-to-promise application for Swift & Company
2006,
Swift & Company uses an integrated system of 45 linear-programming models based on...
Oblique multicategory decision trees using nonlinear programming
Oblique multicategory decision trees using nonlinear programming
2005,
Induction of decision trees is a popular and effective method for solving...
Papers per page: