Found 97029 papers in total
Improved Lagrangean decomposition: An application to the generalized assignment problem
1990,
Recently two new ways of obtaining improved Lagrangean bounds have been suggested: Lagrangean...
An improved annealing scheme for the QAP
1990,
Recently there has been some interest in the use of Simulated Annealing to obtain ‘good’...
The discrete Δà-transformation method in integer programming
1990,
A new method is proposed for solving integer and mixed integer programming problems-the discrete ¦[...
A mixed integer-discrete-continuous programming method and its application to engineering design optimization
1991,
An algorithm for solving non-linear programming problems containing integer, discrete and continuous...
Hyperbolic 0-1 programming and query optimization in information retrieval
1991,
Unconstrained hyperbolic 0-1 programming can be solved in linear time when the numerator and the...
Lagrangean decomposition for integer nonlinear programming with linear constraints
1991,
The authors present a Lagrangean decomposition to study integer nonlinear programming problems. Solving...
Analysis of Lagrangian decomposition for the multi-item capacitated lot-sizing problem
1991,
The multi-item capacitated dynamic lot-sizing problem consists of determining the quantity and the timing...
New procedures for preprocessing 0-1 models with knapsack-like constraints and conjunctive and/or disjunctive variable upper bounds
1991,
The authors present some preprocessing techniques for 0-1 models by taking advantage of the special...
A note on the solution of group knapsack problems
1991,
Using the Nicholson principle the algorithm of Shapiro for solving group knapsack problems is improved. An...
Lagrangean decomposition in integer linear programming: A new scheme
1992,
The authors present a new Lagrangean decomposition scheme for integer linear programming problems. This...
A closed-form solution to a class of quadratic knapsack problems
1992,
One important problem in data base management is checkpointing of computer systems which is the copying of...
Stable numerical methods for solving systems of linear algebraic equations of general form
1989,
Simple stable methods for solving systems of linear algebraic equations (s.l.a.e.), using information...
Solving multiple objective linear programs in objective space
1990,
This paper presents an analysis of the objective space for a multiple objective linear program and...
Constructing the set of efficient objective values in multiple objective linear programs
1990,
In earlier work the authors developed an algebraic description of the polyhedron Y=C[X], where C is a...
On the resemblance between the Kornai-Liptak and cross decomposition techniques for block-angular linear programs
1990,
In this paper the resemblance is demonstrated between the master- and subproblems generated by the...
The general problem of stability analysis in linear programming
1990,
The set of all canonical linear programming problems is considered for which a specified vector is a...
Code for the primal simplex algorithm for LP problems in standard form
1991,
The authors present an APL implementation of the primal simplex algorithm for linear programming problems...
Interior point algorithms for linear programming with inequality constraints
1991,
Interior methods for linear programming were designed mainly for problems formulated with equality...
On the convex programming approach to linear programming
1991,
For a general linear program in Karmarkar’s standard form, Fang recently proposed a new approach...
A descent approach to solving the complementary programming problem
1991,
In recent years, much attention has focused on mathematical programming problems with equilibrium...
A simplex-like method with bisection for linear programming
1991,
The simplex method carries out the pivoting operation on a series of the canonical systems. Using an...
Keep the coffee coming
1991,
A linear programming model was used to assist the company operating the port of Santos in reducing labour...
An inner ellipsoid algorithm for linear programming
1991,
A interior point algorithm for linear programming is developed. At every step of the method a interior...
Generating cuts in integer programming with families of special ordered sets
1990,
This paper describes families of cuts which can be added to integer programming formulation incorporating...
Papers per page:

Paper Filter