Keyword: computational analysis

Found 489 papers in total
A new class of semismooth Newton-type methods for nonlinear complementarity problems
A new class of semismooth Newton-type methods for nonlinear complementarity problems
1998,
We introduce a new, one-parametric class of NCP-functions. This class subsumes the...
A computational study of the homogeneous algorithm for large-scale convex optimization
A computational study of the homogeneous algorithm for large-scale convex optimization
1998,
Recently the authors have proposed a homogeneous and self-dual algorithm for solving...
On improvements to the analytic center cutting plane method
On improvements to the analytic center cutting plane method
1998,
In this paper, we explore a weakness of a specific implementation of the analytic...
Solving the minimum weighted integer coloring problem
Solving the minimum weighted integer coloring problem
1998,
In this paper, we present, as far as we are aware of, the first combinatorial...
The application of preprocessing and cutting plane techniques for a class of production planning problems
The application of preprocessing and cutting plane techniques for a class of production planning problems
1998,
This paper investigates properties of integer programming models for a class of...
A new steepest edge approximation for the simplex method for linear programming
A new steepest edge approximation for the simplex method for linear programming
1998,
The purpose of this paper is to present a new steepest edge (SE) approximation scheme...
Parsimonious least norm approximation
Parsimonious least norm approximation
1998,
A theoretically justifiable fast finite successive linear approximation algorithm is...
Minimizing a sum of norms subject to linear equality constraints
Minimizing a sum of norms subject to linear equality constraints
1998,
Numerical analysis of a class of nonlinear duality problems is presented. One side of...
A global regularization method for solving the finite min–max problem
A global regularization method for solving the finite min–max problem
1998,
A method is presented for solving the finite nonlinear min–max problem....
A structured reduced sequential quadratic programming and its application to a shape design problem
A structured reduced sequential quadratic programming and its application to a shape design problem
1998,
The objective of this work is to solve a model one dimensional duct design problem...
Remarks on: ‘Some extensions of the discrete lotsizing and scheduling problem’
Remarks on: ‘Some extensions of the discrete lotsizing and scheduling problem’
1999,
Computational complexity results provide guideposts toward fruitful directions in...
The b-chromatic number of a graph
The b-chromatic number of a graph
1999,
The achromatic number ψ( G ) of a graph G =( V,E ) is the maximum k such that V...
Generalized partitions of graphs
Generalized partitions of graphs
1999,
A general graph partitioning problem, which includes graph colouring, homomorphism to...
On the algorithmic complexity of twelve covering and independence parameters of graphs
On the algorithmic complexity of twelve covering and independence parameters of graphs
1999,
The definitions of four previously studied parameters related to total coverings and...
Approximating the weight of shallow Steiner trees
Approximating the weight of shallow Steiner trees
1999,
This paper deals with the problem of constructing Steiner trees of minimum weight with...
An 0.828-approximation algorithm for the uncapacitated facility location problem
An 0.828-approximation algorithm for the uncapacitated facility location problem
1999,
The uncapacitated facility location problem in the following formulation is...
Data-dependent bounds for the general and the asymmetric stacker–crane problems
Data-dependent bounds for the general and the asymmetric stacker–crane problems
1999,
The Stacker–Crane Problem (SCP) is a sequencing problem, arising in scheduling...
Deterministic job-shop scheduling: Past, present and future
Deterministic job-shop scheduling: Past, present and future
1999,
Due to the stubborn nature of the deterministic job-shop scheduling problem many...
Earliness penalties on a single machine subject to precedence constraints: Common slack allowance due date assignment
Earliness penalties on a single machine subject to precedence constraints: Common slack allowance due date assignment
1999,
The paper considers the single machine due date assignment and scheduling problems...
Using the exclusion model for Data Envelopment Analysis computation
Using the exclusion model for Data Envelopment Analysis computation
1998,
In the original DEA/CCR (Data Envelopment Analysis/Charnes, Cooper and Rhodes)...
Numerica: A Modeling Language for Global Optimisation
Numerica: A Modeling Language for Global Optimisation
1998,
Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search
Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search
1999,
Computational Issues in High Performance Software for Nonlinear Optimization
Computational Issues in High Performance Software for Nonlinear Optimization
1998,
Computing the nucleolus of min-cost spanning tree games is NP-hard
Computing the nucleolus of min-cost spanning tree games is NP-hard
1998,
We prove that computing the nucleolus of minimum cost spanning tree games is in...
Papers per page: