Country: Netherlands

Found 18376 papers in total
ℝ-optimality criteria for convex programming problems via exact penalty functions
ℝ-optimality criteria for convex programming problems via exact penalty functions
1992,
The paper presents • -optimality criteria for convex programming problems...
Unconstrained duals to partially separable constrained programs
Unconstrained duals to partially separable constrained programs
1992,
In this note partially separable convex programs are dualized in such a way that,...
Conjugate duality and the curse of dimensionality
Conjugate duality and the curse of dimensionality
1991,
If the functional equations of dynamic programming (DP) are viewed as convolutions,...
Optimal control of variable rate coding with incomplete observation in integrated voice/data packet networks
Optimal control of variable rate coding with incomplete observation in integrated voice/data packet networks
1991,
This paper investigates the design of dynamic voice coding rate control with doubly...
New scaling algorithms for the assignment and minimum mean cycle problems
New scaling algorithms for the assignment and minimum mean cycle problems
1992,
In this paper the authors suggest new scaling algorithms for the assignment and...
On pseudolinear functions
On pseudolinear functions
1991,
In this paper the structure of a smooth pseudolinear function is investigated and the...
Lexicographic geometric programming
Lexicographic geometric programming
1991,
The paper presents the Kuhn-Tucker conditions and the duality theory for the...
Goal programming problems with interval coefficients and target intervals
Goal programming problems with interval coefficients and target intervals
1991,
In conventional goal programming, the coefficients of objective functions and...
A comparison of heuristics and relaxations for the Capacitated Plant Location Problem
A comparison of heuristics and relaxations for the Capacitated Plant Location Problem
1991,
Approaches proposed in the literature for the Capacitated Plant Location Problem are...
A facet generation and relaxation technique applied to an assignment problem with side constraints
A facet generation and relaxation technique applied to an assignment problem with side constraints
1991,
The authors consider a solution method for combinatorial optimization problems based...
An extension of a greedy heuristic for the knapsack problem
An extension of a greedy heuristic for the knapsack problem
1991,
The paper considers some of the properties of an extension of the...
Data dependent worst case bound improving techniques in zero-one programming
Data dependent worst case bound improving techniques in zero-one programming
1991,
A simple perturbation of data is suggested for use in conjunction with approximation...
Fast primal and dual heuristics for the p-median location problem
Fast primal and dual heuristics for the p-median location problem
1991,
A greedy-type heuristic is presented for the p- median problem and computational...
An algorithm of internal feasible directions for linear integer programming
An algorithm of internal feasible directions for linear integer programming
1991,
An approximate algorithm for solving pure integer problems is examined. The algorithm...
COAL: A new heuristic approach for solving the fixed charge problem-Computational results
COAL: A new heuristic approach for solving the fixed charge problem-Computational results
1991,
Computational results are presented for a new heuristic algorithm for solving large...
Persistency in quadratic 0-1 optimization
Persistency in quadratic 0-1 optimization
1992,
This paper is concerned with persistency properties which allow the evaluation of some...
Tight integral duality gap in the Chinese Postman problem
Tight integral duality gap in the Chinese Postman problem
1992,
Let G=(V,E) be a graph and let w be a weight function w:E⇒Z’+ . Let...
A polynomial algorithm for an integer quadratic non-separable transportation problem
A polynomial algorithm for an integer quadratic non-separable transportation problem
1992,
The authors study the problem of minimizing the total weighted tardiness when...
Solving combinatorial optimization problems using Karmarkar’s algorithm
Solving combinatorial optimization problems using Karmarkar’s algorithm
1992,
The authors describe a cutting plane algorithm for solving combinatorial optimization...
The practical conversion of Linear Programs to Network Flow Models
The practical conversion of Linear Programs to Network Flow Models
1991,
A practical algorithm for converting Linear (and Integer) Programs to Minimum Cost...
On the finiteness of the criss-cross method
On the finiteness of the criss-cross method
1991,
In this short paper, the finiteness of the criss-cross method is proven by showing a...
A characterisation of the feasible set of objective function vectors in linear multiple objective problems
A characterisation of the feasible set of objective function vectors in linear multiple objective problems
1991,
A theoretical framework is provided for characterising the feasible set of multiple...
Extremal points and optimal solutions for general capacity problems
Extremal points and optimal solutions for general capacity problems
1992,
This paper studies the infinite dimensional linear programming problems in the...
On the best case performance of hit and run methods for detecting necessary constraints
On the best case performance of hit and run methods for detecting necessary constraints
1992,
The hit and run methods are probabilistic algorithms that can be used to detect...
Papers per page: