Similar Search Results

Degeneracy degrees of constraint collections

Sierksma, Gerard; Tijssen, Gert A. - In: Computational Statistics 57 (2003) 3, pp. 437-448

This paper presents an unifying approach to the theory of degeneracy of basic feasible solutions, vertices, faces, and … all subsets of polyhedra. It is a generalization of the usual concept of degeneracy defined for basic feasible solutions … of an LP-problem. We use the concept of degeneracy degree for arbitrary subsets of ℝ n with respect to linear constraint …

Persistent link: https://www.econbiz.de/10010847504

Computational bounds for elevator control policies by large scale linear programming

Heinz, Stefan; Rambau, Jörg; Tuchscherer, Andreas - In: Computational Statistics 79 (2014) 1, pp. 87-117

We computationally assess policies for the elevator control problem by a new column-generation approach for the linear programming method for discounted infinite-horizon Markov decision problems. By analyzing the optimality of given actions in given states, we were able to provably improve the...

Persistent link: https://www.econbiz.de/10010848012

A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks

Montemanni, R.; Leggieri, V. - In: Computational Statistics 74 (2011) 3, pp. 327-342

The Minimum Power Multicast Problem arises in wireless sensor networks and consists in assigning a transmission power to each node of a network in such a way that the total power consumption over the network is minimized, while a source node is connected to a set of destination nodes, toward...

Persistent link: https://www.econbiz.de/10010759122

Selective Gram–Schmidt orthonormalization for conic cutting surface algorithms

Mitchell, John; Basescu, Vasile - In: Computational Statistics 67 (2008) 1, pp. 91-115

It is not straightforward to find a new feasible solution when several conic constraints are added to a conic optimization problem. Examples of conic constraints include semidefinite constraints and second order cone constraints. In this paper, a method to slightly modify the constraints is...

Persistent link: https://www.econbiz.de/10010759124

Long-term staffing based on qualification profiles

Drexl, Andreas; Mundschenk, Martin - In: Computational Statistics 68 (2008) 1, pp. 21-47

Manpower still is one of the most expensive resources, in spite of increasing automation. While employee scheduling and rostering has been the topic of extensive research over the past decades, usually it is assumed that the demand for staff is either given or can be obtained without difficulty....

Persistent link: https://www.econbiz.de/10010759474