Country: Netherlands

Found 18376 papers in total
Controlled dual perturbations for central path trajectories in geometric programming
Controlled dual perturbations for central path trajectories in geometric programming
1994,
A dynamic perturbation algorithm is developed building on the work of Fang, Peterson...
An alternative explanation of disjunctive formulations
An alternative explanation of disjunctive formulations
1994,
The purpose of this paper is to explain the property of Disjunctive Formulations for...
Tools for reformulating logical forms into zero-one mixed integer programs
Tools for reformulating logical forms into zero-one mixed integer programs
1994,
A systematic procedure for transforming a set of logical statements or logical...
On the Dietrich-Escudero approach for solving the 0-1 knapsack problem with a 0-1 objective function
On the Dietrich-Escudero approach for solving the 0-1 knapsack problem with a 0-1 objective function
1994,
In this brief note the authors demonstrate that the Dietrich-Escudero procedure for...
A computational note on the Martello-Toth knapsack algorithm
A computational note on the Martello-Toth knapsack algorithm
1994,
Martello and Toth are well known for their work on the 0-1 kanpsack problem....
The growth of multi-constraint random knapsacks with various right-hand sides of the constraints
The growth of multi-constraint random knapsacks with various right-hand sides of the constraints
1994,
The asymptotic value of the m- constraint, n- variable, 0-1 random kanpsack problem...
Strong linear programming relaxations for the orienteering problem
Strong linear programming relaxations for the orienteering problem
1994,
Consider a set of nodes, each with an associated profit, and a set of arcs, each with...
Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts
Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts
1994,
The authors show how clique and cover induced inequalities implied from 0-1 knapsack...
A multi-KP modeling for the maximum-clique problem
A multi-KP modeling for the maximum-clique problem
1994,
In this paper the problem of finding the maximum clique of an arbitrary graph G=(X,A)...
A global approach for general 0-1 fractional programming
A global approach for general 0-1 fractional programming
1994,
Current methods of general 0-1 fractional programming (G-FP) can only find the local...
Submodular linear programs on forests
Submodular linear programs on forests
1996,
A general linear programming model for an order-theoretic analysis of both...
Extended formulations for the A-cut problem
Extended formulations for the A-cut problem
1996,
Let G=(V,E) be an undirected graph and A⊆V. The authors consider the problem of...
Gomory cuts revisited
Gomory cuts revisited
1996,
The authors investigate the use of Gomory’s mixed integer cuts within a...
A mixed-integer model for solving ordering problems with side constraints
A mixed-integer model for solving ordering problems with side constraints
1997,
The authors present an exact approach for solving the Sequential Ordering Problem. In...
Aggregation and decomposition for multi-divisional linear programs
Aggregation and decomposition for multi-divisional linear programs
1994,
This paper proposes the use of linear programming aggregation theory to study...
On the efficient point set of tricriteria linear programs
On the efficient point set of tricriteria linear programs
1994,
The authors consider linear programs with three objective functions and investigate...
gLPS: A graphical tool for the definition and manipulation of linear problems
gLPS: A graphical tool for the definition and manipulation of linear problems
1994,
The use of suitable tools is one of the cornerstones of every aspect of human...
Syntax-directed report writing in linear programming using ANALYZE
Syntax-directed report writing in linear programming using ANALYZE
1994,
The syntax of a linear program is its rules for composing activities and equations....
MOPS-Mathematical OPtimization System
MOPS-Mathematical OPtimization System
1994,
This paper discusses a software system for solving large scale linear and...
Some results concerning post-infeasibility analysis
Some results concerning post-infeasibility analysis
1994,
Linear constraints are used to model diverse phenomena. The number of constraints is...
Characterizing an optimal solution to the linear bilevel programming problem
Characterizing an optimal solution to the linear bilevel programming problem
1994,
This note presents a theorem which characterizes the geometry of an optimal solution...
Solution procedures for cutting limber into furniture parts
Solution procedures for cutting limber into furniture parts
1994,
Knapsack algorithms are developed to determine the optimal cutting pattern of a parent...
Weights improvement in column aggregation
Weights improvement in column aggregation
1994,
The present paper studies how the weights used in column aggregation of linear...
A multisplitting method for symmetric linear complementarity problems
A multisplitting method for symmetric linear complementarity problems
1995,
Over the years, many methods for solving the linear complementarity problem (LCP) have...
Papers per page: