Country: Netherlands

Found 18376 papers in total
The noising method: A new method for combinatorial optimization
The noising method: A new method for combinatorial optimization
1993,
This paper presents the principles and the first results of a new combinatorial...
Adjacency of the best and second best valued solutions in combinatorial optimization problems
Adjacency of the best and second best valued solutions in combinatorial optimization problems
1993,
The authors say that a polytope satisfies the strong adjacency property if every best...
Experiments with parallel branch-and-bound algorithms for the set covering problem
Experiments with parallel branch-and-bound algorithms for the set covering problem
1993,
The authors discuss the results of computational experiments using a new parallel...
Matroidal relaxations for 0-1 knapsack problems
Matroidal relaxations for 0-1 knapsack problems
1993,
The family of the feasible solutions for a Knapsack with positive coefficients, , is...
The senior and junior secretaries problem
The senior and junior secretaries problem
1993,
The paper considers a generalization of the classical secretary problem, in which an...
Efficient reformulation for 0-1 programs-Methods and computational results
Efficient reformulation for 0-1 programs-Methods and computational results
1993,
The authors introduce two general methods for 0-1 program reformulation. The present...
Lagrangean methods for 0-1 quadratic problems
Lagrangean methods for 0-1 quadratic problems
1993,
Three Lagrangean methods for 0-1 quadratic programming are presented. The first one...
Solving sequential knapsack problems
Solving sequential knapsack problems
1993,
The authors give an O( n log n) algorithm for solving sequential knapsack problems,...
On the mixed Chinese postman problem
On the mixed Chinese postman problem
1993,
The mixed Chinese postman problem is a version of the well-known Chinese postman...
Two-thirds is sharp for affine scaling
Two-thirds is sharp for affine scaling
1993,
Tsuchiya and Muramatsu recently proved that the affine-scaling algorithm for linear...
A primal-dual simplex method for linear programs
A primal-dual simplex method for linear programs
1993,
A primal-dual algorithm is developed that optimizes a dual program in concert with...
On the complexity of a special basis problem in LP
On the complexity of a special basis problem in LP
1993,
In a linear program in standard form, the paper shows that the problem of finding a...
K-K-T multiplier estimates and objective function lower bounds from projective SUMT
K-K-T multiplier estimates and objective function lower bounds from projective SUMT
1993,
Estimates of Karush-Kuhn-Tucker (K-K-T) multipliers and a lower bound on the objective...
A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set
A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set
1993,
In this paper the authors define a new continuously differentiable exact penalty...
Algorithms for minimizing maximum lateness with unit length tasks and resource constraints
Algorithms for minimizing maximum lateness with unit length tasks and resource constraints
1993,
The problem the authors consider is that of scheduling n unit length tasks on...
Linear time algorithms for some separable quadratic programming problems
Linear time algorithms for some separable quadratic programming problems
1993,
A large class of separable quadratic programming problems is presented. The problems...
Sequential and parallel local search for the time-constrained traveling salesman problem
Sequential and parallel local search for the time-constrained traveling salesman problem
1993,
Local search has proven to be an effective solution approach for the traveling...
Completion time variance minimization on a single machine is difficult
Completion time variance minimization on a single machine is difficult
1993,
The complexity of the completion time variance minimization (CTV) problem on a single...
Bounds and asymptotic results for the uniform parallel processor weighted flow time problem
Bounds and asymptotic results for the uniform parallel processor weighted flow time problem
1993,
Lower and upper bounds are derived for the NP-hard problem of scheduling n jobs on m...
Minimizing the fleet size with dependent time-window and single-track constraints
Minimizing the fleet size with dependent time-window and single-track constraints
1993,
This paper considers the problem of determining a cyclic schedule that minimizes the...
A note on LPT scheduling
A note on LPT scheduling
1993,
In the theory of parallel-machine scheduling, the Largest Processing-Time-first (LPT)...
A note on a stochastic location problem
A note on a stochastic location problem
1993,
In this note the authors give a short and easy proof of the equivalence of...
The complexity of one-machine batching problems
The complexity of one-machine batching problems
1993,
Batching problems are combinations of sequencing and partitioning problems. For each...
A note on the pathwise version of Little’s formula
A note on the pathwise version of Little’s formula
1993,
The classical result of Little states that the average number of customers in a queue...
Papers per page: