Country: Netherlands

Found 18376 papers in total
Different transformations for solving non-convex trim-loss problems by mixed integer nonlinear programming
1998,
In the present paper trim-loss problems, often named the cutting stock problem,...
An approximately global optimization method for assortment problems
1998,
Assortment problems occur when we want to cut a number of small rectangular pieces...
A GRASP for the biquadratic assignment problem
1998,
The biquadratic assignment problem (BiQAP) is a generalization of the quadratic...
On characterizing tighter formulations for 0–1 programs
1998,
We present two approaches for 0–1 program model tightening. They are based on...
Some exact algorithms for the knapsack sharing problem
1998,
The knapsack sharing problem (KSP) is formulated as an extension to the ordinary...
Solving zero–one mixed integer programming problems using tabu search
1998,
We describe a tabu search (TS) approach for solving general zero–one mixed...
Balancing U-lines in a multiple U-line facility
1998,
U-shaped production lines and facilities consisting of many such lines are important...
An adaptive tabu search approach to JIT sequencing with variable processing times and sequence-dependent setups
1998,
This paper addresses a single machine sequencing problem with variable processing...
Cutting planes for integer programs with general integer variables
1998,
We investigate the use of cutting planes for integer programs with general integer...
A Lagrangian-based heuristic for large-scale set covering problems
1998,
We present a new Lagrangian-based heuristic for solving large-scale set-covering...
The node capacitated graph partitioning problem: A computational study
1998,
In this paper we consider the problem of k -partitioning the nodes of a graph with...
Reacting in real-time to production contingencies in a capacitated flexible cell
1998,
We present a PC-based procedure for the real-time revision of production and inventory...
Cutting planes for mixed-integer knapsack polyhedra
1998,
An algorithm for generating cutting planes for mixed-integer knapsack polyhedra is...
Manufacturing planning and control: The evolution of MRP and JIT integration
1998,
Material Requirements Planning (MRP) and Just-in-Time (JIT) system are directed toward...
Using simulation to evaluate the introduction of a Kanban subsystem within an MRP-controlled manufacturing environment
1998,
A large assembly plant of parts for the automotive industry uses an MRP system for the...
Newton's method for linear inequality systems
1998,
We describe a modified Newton type algorithm for the solution of linear inequality...
A net present value approach to safety stocks in planned production
1998,
In a number of recent papers, the Laplace transform together with input-output...
The role of the augmented system in interior point methods
1998,
We present a way to use the augmented system approach in interior point methods. We...
Optimal production run for processes with constant and random drifts
1998,
In this paper, we consider a production process with a continuous drift in the mean of...
Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
1998,
In exact arithmetic, the simplex method applied to a particular linear programming...
An interior point method, based on rank-1 updates, for linear programming
1998,
We propose a polynomial time primal–dual potential reduction algorithm for...
Balinski–Tucker Simplex Tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces
1998,
This paper shows the relationship between degeneracy degrees and multiple solutions in...
Simplifying a special class of mathematical programs arising in design problems
1998,
We consider a special class of mathematical programs that are encountered in certain...
Papers per page: