Country: Switzerland

Found 927 papers in total
Minimal length tree networks on the unit sphere
Minimal length tree networks on the unit sphere
1991,
This paper considers the problem of finding minimal length tree networks on the unit...
The role of Steiner hulls in the solution to Steiner tree problems
The role of Steiner hulls in the solution to Steiner tree problems
1991,
A Steiner tree problem on the plane is that of finding a minimum length Steiner tree...
A simple proof of Hwang’s theorem for rectilinear Steiner minimal trees
A simple proof of Hwang’s theorem for rectilinear Steiner minimal trees
1991,
The authors present a simple, direct proof of Hwang’s characterization of...
On graphs preserving rectilinear shortest paths in the presence of obstacles
On graphs preserving rectilinear shortest paths in the presence of obstacles
1991,
In physical VLSI design, network design (wiring) is the most time-consuming phase. For...
Steiner minimal trees for three points with one convex polygonal obstacle
Steiner minimal trees for three points with one convex polygonal obstacle
1991,
The problem of constructing Steiner minimal trees in the Euclidean plane in NP-hard....
Efficient implementation of heuristics for the continuous network design problem
Efficient implementation of heuristics for the continuous network design problem
1991,
In this paper, the authors present an efficient implementation of heuristic procedures...
Least-cost network topology design for a new service: An application of tabu search
Least-cost network topology design for a new service: An application of tabu search
1991,
The authors describe an implementation of the tabu search metaheuristic that...
Polynomially solvable special cases of the Steiner problem in planar networks
Polynomially solvable special cases of the Steiner problem in planar networks
1991,
The authors give polynomial-time algorithms for two special cases of the Steiner...
Solving nonlinear bilevel programming models of the equilibrium network design problem: A comparative review
Solving nonlinear bilevel programming models of the equilibrium network design problem: A comparative review
1992,
Nonlinear bilevel programming problems, of which the equilibrium network design...
Computing shortest paths in networks derived from recurrence relations
Computing shortest paths in networks derived from recurrence relations
1991,
Dynamic programming formulations of optimization problems often call for the...
Ancestor tree for arbitrary multi-terminal-cut functions
Ancestor tree for arbitrary multi-terminal-cut functions
1991,
In many applications, a function is defined on the cuts of a network. In the max-flow...
Hierarchical optimization: An introduction
Hierarchical optimization: An introduction
1992,
Decision problems involving multiple agents invariably lead to conflict and gaming. In...
Double penalty method for bilevel optimization problems
Double penalty method for bilevel optimization problems
1992,
A penalty function method approach for solving a constrained bilevel optimization...
A sequential LCP method for bilevel linear programming
A sequential LCP method for bilevel linear programming
1992,
In this paper, the authors discuss an SLCP algorithm for the solution of Bilevel...
Implicitly defined optimization problems
Implicitly defined optimization problems
1992,
This paper considers the solution of the problem: inf f[y,x(y)] s.t....
Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming
Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming
1992,
When the follower’s optimality conditions are both necessary and sufficient, the...
Combinatorial aspects of network reliability
Combinatorial aspects of network reliability
1991,
This is a short tutorial introduction to combinatorial aspects of network reliability,...
Network reliability: Numbers or insight?
Network reliability: Numbers or insight?
1991,
One of the mandates of the NATO Advanced Research Workshop on topological Network...
Implementations of parallel branch-and-bound algorithms: Experience with the graph partitioning problem
Implementations of parallel branch-and-bound algorithms: Experience with the graph partitioning problem
1991,
Parallel processing is one of the essential concepts in the attempts to increase the...
Optimally reliable networks
Optimally reliable networks
1991,
The paper considers the probability of disconnection of a graph as a measure of...
Branch-and-bound as a higher-order function
Branch-and-bound as a higher-order function
1991,
The branch-and-bound paradigm is presented as a higher-order function and illustrated...
Supplier-customer interaction in quality control
Supplier-customer interaction in quality control
1992,
The paper develops a game theoretic model of joint quality control in a single...
The computational complexity of multi-level linear programs
The computational complexity of multi-level linear programs
1992,
The paper shows that ( L+1 )-level linear programs are as difficult as level L of...
Heuristic algorithms for delivered price spatially competitive network facility location problems
Heuristic algorithms for delivered price spatially competitive network facility location problems
1991,
The authors review previous formulations of models for locating a firm’s...
Papers per page: