Country: Netherlands

Found 18376 papers in total
The bounds of feasible space on constrained nonconvex quadratic programming
The bounds of feasible space on constrained nonconvex quadratic programming
2008,
This paper presents a method to estimate the bounds of the radius of the feasible...
A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
2008,
The ‘roof dual’ of a QUBO (Quadratic Unconstrained Binary Optimization)...
An efficient generalized network-simplex-based algorithm for manufacturing network flows
An efficient generalized network-simplex-based algorithm for manufacturing network flows
2008,
Fang and Qi introduced a new generalized network flow model called manufacturing...
Involving the Helly number in Pareto reducibility
Involving the Helly number in Pareto reducibility
2008,
The principal aim of this paper is to show that every weakly efficient solution of a...
Duality for set-valued multiobjective optimization problems, part 2: Optimal control
Duality for set-valued multiobjective optimization problems, part 2: Optimal control
2008,
The present paper is a continuation of a paper by Azimov, where we derived duality...
Duality for set-valued multiobjective optimization problems, part 1: Mathematical programming
Duality for set-valued multiobjective optimization problems, part 1: Mathematical programming
2008,
The duality of multiobjective problems is studied with the help of the apparatus of...
Polytopes and arrangements: Diameter and curvature
Polytopes and arrangements: Diameter and curvature
2008,
We introduce a continuous analogue of the Hirsch conjecture and a discrete analogue of...
A power penalty method for linear complementarity problems
A power penalty method for linear complementarity problems
2008,
We propose a power penalty approach to a linear complementarity problem (LCP) in...
Note on pseudolattices, lattices and submodular linear programs
Note on pseudolattices, lattices and submodular linear programs
2008,
A pseudolattice L is a poset with lattice-type binary operations. Given a submodular...
Local analysis of the feasible primal–dual interior-point method
Local analysis of the feasible primal–dual interior-point method
2008,
In this paper we analyze the rate of local convergence of the Newton primal–dual...
A primal deficient-basis simplex algorithm for linear programming
A primal deficient-basis simplex algorithm for linear programming
2008,
The standard basis, which plays a fundamental role in simplex methodology, was...
Nonconvex, lower semicontinuous piecewise linear optimization
Nonconvex, lower semicontinuous piecewise linear optimization
2008,
A branch-and-cut algorithm for solving linear problems with continuous separable...
Intermediate integer programming representations using value disjunctions
Intermediate integer programming representations using value disjunctions
2008,
We introduce a general technique for creating an extended formulation of a...
Higher-order cover cuts from zero–one knapsack constraints augmented by two-sided bounding inequalities
Higher-order cover cuts from zero–one knapsack constraints augmented by two-sided bounding inequalities
2008,
Extending our work on second-order cover cuts, we introduce a new class of...
How tight is the corner relaxation?
How tight is the corner relaxation?
2008,
Given a mixed-integer linear programming (MILP) model and an optimal basis of the...
Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
2008,
Cover inequalities are commonly used cutting planes for the 0–1 knapsack...
N-fold integer programming
N-fold integer programming
2008,
In this article we study a broad class of integer programming problems in variable...
An algorithmic framework for convex mixed integer nonlinear programs
An algorithmic framework for convex mixed integer nonlinear programs
2008,
This paper is motivated by the fact that mixed integer nonlinear programming is an...
George Dantzig's contributions to integer programming
George Dantzig's contributions to integer programming
2008,
This paper reviews George Dantzig's contributions to integer programming, especially...
Accelerating method of global optimization for signomial geometric programming
Accelerating method of global optimization for signomial geometric programming
2008,
Signomial geometric programming (SGP) has been an interesting problem for many authors...
A pricing problem under Monge property
A pricing problem under Monge property
2008,
We study a pricing problem where buyers with non-uniform demand purchase one of many...
Variable fixing algorithms for the continuous quadratic knapsack problem
Variable fixing algorithms for the continuous quadratic knapsack problem
2008,
We study several variations of the Bitran–Hax variable fixing method for the...
A polynomial path following algorithm for convex programming
A polynomial path following algorithm for convex programming
2008,
In this paper, based on combined homotopy interior point method we propose an interior...
On the Kth best base of a matroid
On the Kth best base of a matroid
2008,
Given a weighted matroid M and a positive integer K , the K th best base of M problem...
Papers per page: