Keyword: computational analysis

Found 489 papers in total
Heuristic algorithms for the Multiple Depot Vehicle Scheduling Problem
Heuristic algorithms for the Multiple Depot Vehicle Scheduling Problem
1993,
The authors consider the NP-hard Multiple Depot Vehicle Scheduling Problem, in which a...
Limiting the number of each piece in two-dimensional cutting stock patterns
Limiting the number of each piece in two-dimensional cutting stock patterns
1992,
Being able to limit the number of each piece appearing in one pattern is an important...
Solution to the assortment problem via the genetic algorithm
Solution to the assortment problem via the genetic algorithm
1992,
The assortment problem considers what standard sizes of material should be maintained...
Solving a cutting-stock problem with the constraint logic programming language CHIP
Solving a cutting-stock problem with the constraint logic programming language CHIP
1992,
CHIP is a new constraint logic programming language combining the declarative aspect...
Roundness problem-An approach from computational geometry
Roundness problem-An approach from computational geometry
1992,
Roundness is one of the most important geometric measures for circular objects in the...
Convex tree realizations of partitions
Convex tree realizations of partitions
1992,
Given a collection P of partitions of a label set L a problem arising in biological...
A linear pivoting method for detecting and tracing planar section curves of free-form surfaces
A linear pivoting method for detecting and tracing planar section curves of free-form surfaces
1992,
A linear programming procedure is presented for finding the curves of intersection of...
Computationally efficient methods for calculating the ideal solution for MOLP problems
Computationally efficient methods for calculating the ideal solution for MOLP problems
1992,
This paper presents the results of an investigation into computational considerations...
An algorithm for linearly constrained programs with a partly linear objective function
An algorithm for linearly constrained programs with a partly linear objective function
1992,
A Newton-type algorithm for finding a minimum of a function, subject to linear...
On a general network location-production-allocation problem
On a general network location-production-allocation problem
1991,
In this paper the authors consider a network location-production-allocation problem in...
The complexity of shop-scheduling problems with two or three jobs
The complexity of shop-scheduling problems with two or three jobs
1991,
This paper deals with the n/m/ J/ C max problem of optimal makespan scheduling n jobs...
Generalized Nash games and quasi-variational inequalities
Generalized Nash games and quasi-variational inequalities
1991,
A generalized Nash game is an n- person noncooperative game with nondisjoint strategy...
A linear time algorithm for the maximum capacity path problem
A linear time algorithm for the maximum capacity path problem
1991,
The maximum capacity path problem is to find a path joining two fixed vertices of an...
Computational investigations on 3-dimensional axial assignment problems
Computational investigations on 3-dimensional axial assignment problems
1992,
Branch-and-bound approaches for axial three-dimensional assignment problems are...
Asymptotic behavior of the Weber location problem on the plane
Asymptotic behavior of the Weber location problem on the plane
1993,
The asymptotic behavior of the Weber location problem is investigated. The authors...
On worst-case aggregation analysis for network location problems
On worst-case aggregation analysis for network location problems
1993,
Network location problems occur when new facilities must be located on a network, and...
A multiversion cautious scheduler with dynamic serialization constraints for database concurrency control
A multiversion cautious scheduler with dynamic serialization constraints for database concurrency control
1992,
Let MC stand for a class of logs (i.e., sequences of read/write steps) that are...
Discrete regularization of optimal control problems on ill-posed monotone variational inequalities
Discrete regularization of optimal control problems on ill-posed monotone variational inequalities
1991,
The paper considers the problem of minimizing an abstract functional which depends on...
Errata to ‘Selecting the top three elements’ by M. Aigner: A result of a computer-assisted proof search
Errata to ‘Selecting the top three elements’ by M. Aigner: A result of a computer-assisted proof search
1993,
Based on negative results of an attempt to re-establish the known results for the...
Computational methods of optimal stochastic control. Optimality principle and successive-approximation optimization scheme
Computational methods of optimal stochastic control. Optimality principle and successive-approximation optimization scheme
1991,
The computation of an optimal strategy in the sense of the expected utility criterion...
Strong elimination ordering of the total graph of a tree
Strong elimination ordering of the total graph of a tree
1992,
Total graphs of trees were proved strongly chordal by Martin Farber. The authors give...
Stability number of bull- and chair-free graphs
Stability number of bull- and chair-free graphs
1993,
A bull is the graph with vertices a,b,c,d,e and edges ab,ac,bc,ad,be; a chair is the...
General vertex disjoint paths in series-parallel graphs
General vertex disjoint paths in series-parallel graphs
1993,
Let G=(V,E) be an undirected graph and let ( s i ,t i ), 1•i•k be k pairs of...
Strongly polynomial Auction algorithms for shortest path
Strongly polynomial Auction algorithms for shortest path
1991,
An Auction algorithm for shortest paths was recently proposed by Bertsekas. Under the...
Papers per page: