Country: Japan

Found 1012 papers in total
A two phase, cooperative detailed/global parallel wire-routing algorithm
A two phase, cooperative detailed/global parallel wire-routing algorithm
1996,
This paper introduces a parallel global and detailed wire router. This router is...
Models and Measures for Efficiency Dominance in DEA Part I: Additive models and MED measures
Models and Measures for Efficiency Dominance in DEA Part I: Additive models and MED measures
1996,
The usual models in DEA (Data Envelopment Analysis) employ a postulate of continuity...
Models and measures for efficiency dominance in DEA Part II: Free Disposal Hull (FDH) and Russell Measure (RM) approaches
Models and measures for efficiency dominance in DEA Part II: Free Disposal Hull (FDH) and Russell Measure (RM) approaches
1996,
Models and measures of efficiency dominance as treated by Free Disposal Hull and...
A sequential allocation problem with search cost where the shoot-look-shoot policy is employed
A sequential allocation problem with search cost where the shoot-look-shoot policy is employed
1996,
Suppose a hunter starts hunting over t periods with i bullets. A distribution of the...
A two-dimensional maximum searching method by a combined global priority strategy with local peak estimation
A two-dimensional maximum searching method by a combined global priority strategy with local peak estimation
1996,
This paper presents a maximum search procedure using a combined global priority...
A block-parallel conjugate gradient method for separable quadratic programming problems
A block-parallel conjugate gradient method for separable quadratic programming problems
1996,
For a large-scale quadratic programming problem with a separable objective function, a...
Global optimization problem with multiple reverse convex constraints and its application to out-of-roundness problem
Global optimization problem with multiple reverse convex constraints and its application to out-of-roundness problem
1996,
The authors consider a global minimization problem: , where X and Y are polytopes in...
Vehicle scheduling on a tree to minimize maximum lateness
Vehicle scheduling on a tree to minimize maximum lateness
1996,
In this paper the authors deal with a single-vehicle scheduling problem on a...
A case-based reasoning approach for scheduling unrelated parallel machines
A case-based reasoning approach for scheduling unrelated parallel machines
1996,
In this paper, the authors propose a Case-Based Reasoning (CBR) approach for...
Adaptive mean field approximation algorithm with critical temperature for combinatorial optimization problem
Adaptive mean field approximation algorithm with critical temperature for combinatorial optimization problem
1996,
The mean field approximation algorithm has applied by many researchers to solve...
Bond portfolio optimization problems and their applications to index tracking: A partial optimization approach
Bond portfolio optimization problems and their applications to index tracking: A partial optimization approach
1996,
The authors will discuss exact and efficient parametric simplex algorithms for solving...
Approach to Nurse Scheduling Problem with individual difference of preference in work hours
Approach to Nurse Scheduling Problem with individual difference of preference in work hours
1996,
It is important in health care to plan for a shortage of nurses, especially in view of...
GA based optimization of heuristic search
GA based optimization of heuristic search
1996,
The authors present a generic method adding GA (Genetic Algorithm) to a given...
A selection rule for parallel branch and bound algorithms
A selection rule for parallel branch and bound algorithms
1996,
Branch and bound algorithms are general purpose intelligent enumeration techniques for...
Optimal number of digits to report
Optimal number of digits to report
1996,
Instrumentation, computation, and documentation often involve the task of reporting a...
Reliability of a circular connected-(r, s)-out-of-(m, n): F lattice system
Reliability of a circular connected-(r, s)-out-of-(m, n): F lattice system
1996,
A circular connected-(r, s)-out-of-(m, n): F lattice system has m . n components and...
Minimizing total tardiness for single machine sequencing
Minimizing total tardiness for single machine sequencing
1996,
The authors consider the single machine sequencing problem in which each job has a...
Constructing a cactus representation for all minimum cuts in an undirected network
Constructing a cactus representation for all minimum cuts in an undirected network
1996,
The construction of a cactus representation for all minimum cuts in an edge-weighted,...
An approach based on necessity measure to the fuzzy spanning tree problems
An approach based on necessity measure to the fuzzy spanning tree problems
1996,
On the decision problems with defective information, the uncertain elements are often...
Is a given flow uncontrollable?
Is a given flow uncontrollable?
1996,
An s-t flow in a directed network is called ‘uncontrollable’, when the...
Partial proximal method of multipliers for convex programming problems
Partial proximal method of multipliers for convex programming problems
1996,
Two variants of the partial proximal method of multipliers are proposed for solving...
An algorithm for a multiobjective, multilevel linear programming
An algorithm for a multiobjective, multilevel linear programming
1996,
This paper discusses a solution method to a multiobjective, multi-level decentralized...
MAP/G/1 queues under N-policy with and without vacations
MAP/G/1 queues under N-policy with and without vacations
1996,
This paper considers MAP/G/1 queueing systems under the following two situations: (1)...
A nonpreemptive priority MAP/G/1 queue with two classes of customers
A nonpreemptive priority MAP/G/1 queue with two classes of customers
1996,
This paper considers a nonpreemptive priority queue with two classes of customers....
Papers per page: