Country: Hungary

Found 107 papers in total
On expert systems of mathematical programming
On expert systems of mathematical programming
1992,
The paper investigated the requirements, which ensure that a mathematical programming...
Computational notes to the Gilmore-Gormory cutting stock algorithm
Computational notes to the Gilmore-Gormory cutting stock algorithm
1992,
In this paper an extension and computational modifications of the Gilmore-Gomory...
A clustering global optimization method for parameter estimation problems
A clustering global optimization method for parameter estimation problems
1992,
In this paper it is first shown that the objective function of a least squares type...
Generalized monotonicity and generalized convexity
Generalized monotonicity and generalized convexity
1993,
Generalized monotonicity of generalized derivatives is a rather new concept in...
The linear production smoothing problem
The linear production smoothing problem
1992,
The aim of the paper is to investigate the linear production smoothing problem, in the...
Quasiconvex first order approximations
Quasiconvex first order approximations
1990,
The role of the concept of first order approximation introduced by A.D. Ioffe and...
Analysis of the duality between linear and loglinear families of distributions by geometric programming
Analysis of the duality between linear and loglinear families of distributions by geometric programming
1990,
Given a family of probability distributions defined by linear internal constraints and...
Adaptive partitioning strategies for solving multiextremal optimization problems
Adaptive partitioning strategies for solving multiextremal optimization problems
1990,
Following a brief introduction to the subject of multiextremal (global) optimization,...
Optima of dual integer programs
Optima of dual integer programs
1988,
The authors consider dual pairs of packing and covering integer linear programs. Best...
The Schrijver system of odd join polyhedra
The Schrijver system of odd join polyhedra
1988,
Graphs for which the set of t -joins and t- cuts has ‘the max-flow-min-cut...
Improved processor bounds for combinatorial problems in RNC
Improved processor bounds for combinatorial problems in RNC
1988,
The authors’ main result improves the known processor bound by a factor of n 4...
Papers per page: