Country: Netherlands

Found 18376 papers in total
A smoothing method for a mathematical program with P-matrix linear complementarity constraints
A smoothing method for a mathematical program with P-matrix linear complementarity constraints
2004,
We consider a mathematical program whose constraints involve P-matrix linear...
Semi-infinite programming and applications to minimax problems
Semi-infinite programming and applications to minimax problems
2003,
A minimisation problem with infinitely many constraints – semi-infinite...
Surrogate duality based method for contact problems
Surrogate duality based method for contact problems
2004,
We present a numerical method based on surrogate duality to solve contact problems in...
Optimal legal firing sequence of Petri nets using linear programming
Optimal legal firing sequence of Petri nets using linear programming
2004,
Petri nets (PNs) are a reliable graphical and mathematical modeling tool for the...
A demand-shifting feasibility algorithm for Benders decomposition
A demand-shifting feasibility algorithm for Benders decomposition
2003,
Benders decomposition is a popular method for solving problems by resource-directive...
An efficient simplex type algorithm for sparse and dense linear programs
An efficient simplex type algorithm for sparse and dense linear programs
2003,
We present a big- M method for solving general linear programming problems with a...
On solving linear programs with the ordered weighted averaging objective
On solving linear programs with the ordered weighted averaging objective
2003,
The problem of aggregating multiple criteria to form overall objective functions is of...
Distributed Fejer processes for systems of linear inequalities and problems of linear programming
Distributed Fejer processes for systems of linear inequalities and problems of linear programming
2004,
Consideration was given to the proper (solvable) and improper (having no conventional...
Dual regularization, marginal (repeated) values of the linear programming problem
Dual regularization, marginal (repeated) values of the linear programming problem
2004,
Regularizing transformations of the linear programming problem were proposed and used...
Nonparametric frontier estimation by linear programming
Nonparametric frontier estimation by linear programming
2004,
A new method for estimating the frontier of a set of points (or a support, in other...
Large scale linear programs and heuristics for the design of survivable telecommunications networks
Large scale linear programs and heuristics for the design of survivable telecommunications networks
2003,
We consider the problem of providing a minimum cost multi-service network subject to...
A general pricing scheme for the simplex method
A general pricing scheme for the simplex method
2003,
In the simplex method for linear programming the algorithmic step for checking the...
Structural optimization of large heterogeneous systems
Structural optimization of large heterogeneous systems
2003,
The structural optimization of a large system designed from several types of base...
Application of a mixed simulated annealing–genetic algorithm heuristic for the two-dimensional orthogonal packing problem
Application of a mixed simulated annealing–genetic algorithm heuristic for the two-dimensional orthogonal packing problem
2003,
In this paper a pure meta-heuristic (genetic algorithm) and a mixed meta-heuristic...
Dynamic capacity acquisition and assignment under uncertainty
Dynamic capacity acquisition and assignment under uncertainty
2003,
Given a set of m resources and n tasks, the dynamic capacity acquisition and...
Some fixed-point results for the dynamic assignment problem
Some fixed-point results for the dynamic assignment problem
2003,
In previous work the authors consider the dynamic assignment problem, which involves...
The rectangular packing problem: local optimum search methods based on block structures
The rectangular packing problem: local optimum search methods based on block structures
2004,
Orthogonal packing of rectangles in a semi-infinite strip and its representation by...
The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
2004,
This article presents a branch-and-cut algorithm for the Generalized Minimum Spanning...
An approximation algorithm for computing longest paths
An approximation algorithm for computing longest paths
2003,
We show that the color-coding method of Alon et al ., in its version specialized to...
A network improvement problem under different norms
A network improvement problem under different norms
2004,
In this paper, we first consider a network improvement problem, called...
A comparison of heuristics for the discrete cost multicommodity network optimization problem
A comparison of heuristics for the discrete cost multicommodity network optimization problem
2003,
In this paper, approximate solutions algorithms for discrete cost multicommodity...
An incremental procedure for improving path assignment in a telecommunications network
An incremental procedure for improving path assignment in a telecommunications network
2003,
A fundamental problem in the design and management of a telecommunications network is...
Uncapacitated point-to-multipoint network flow problem and its application to multicasting in telecommunication networks
Uncapacitated point-to-multipoint network flow problem and its application to multicasting in telecommunication networks
2003,
This paper introduces an uncapacitated point-to-multipoint network flow problem where...
A heuristic for the continuous capacity and flow assignment
A heuristic for the continuous capacity and flow assignment
2003,
This work deals with the Continuous Capacity and Flow Assignment (CFA) problem for the...
Papers per page: