Keyword: relaxation methods

Found 21 papers in total
Multivariate McCormick relaxations
Multivariate McCormick relaxations
2014,
McCormick (Math Prog 10(1):147–175, 1976) provides the framework for...
Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem
Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem
2002,
Column generation has proved to be an effective technique for solving the linear...
SOR waveform relaxation methods for stochastic differential equations
SOR waveform relaxation methods for stochastic differential equations
2013,
Waveform relaxation for solving large‐scale systems of ordinary differential...
Handelman rank of zero‐diagonal quadratic programs over a hypercube and its applications
Handelman rank of zero‐diagonal quadratic programs over a hypercube and its applications
2013,
It has been observed that the Handelman’s certificate of positivity of a...
Combining Lift‐and‐Project and Reduce‐and‐Split
Combining Lift‐and‐Project and Reduce‐and‐Split
2013,
Split cuts constitute a class of cutting planes that has been successfully employed by...
Backdoor Branching
Backdoor Branching
2013,
We present an exact mixed‐integer programming (MIP) solution scheme where a...
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
2013,
Given a simple undirected graph, the problem of finding a maximum subset of vertices...
Algorithmic improvements on dynamic programming for the bi‐objective {0,1} knapsack problem
Algorithmic improvements on dynamic programming for the bi‐objective {0,1} knapsack problem
2013,
This paper presents several methodological and algorithmic improvements over a...
Convex relaxations and MIQCQP reformulations for a class of cardinality‐constrained portfolio selection problems
Convex relaxations and MIQCQP reformulations for a class of cardinality‐constrained portfolio selection problems
2013,
In this paper we investigate a class of cardinality‐constrained portfolio...
Bound reduction using pairs of linear inequalities
Bound reduction using pairs of linear inequalities
2013,
We describe a procedure to reduce variable bounds in mixed integer nonlinear...
Optimality conditions under relaxed quasiconvexity assumptions using star and adjusted subdifferentials
Optimality conditions under relaxed quasiconvexity assumptions using star and adjusted subdifferentials
2011,
A set‐constrained optimization problem and a mathematical programming problem...
New formulations of the Hop‐Constrained Minimum Spanning Tree problem via Miller–Tucker–Zemlin constraints
New formulations of the Hop‐Constrained Minimum Spanning Tree problem via Miller–Tucker–Zemlin constraints
2011,
Given an undirected network with positive edge costs and a natural number p , the...
Iterative methods with analytical preconditioning technique to linear complementarity problems: application to obstacle problems
Iterative methods with analytical preconditioning technique to linear complementarity problems: application to obstacle problems
2013,
For solving linear complementarity problems LCP more attention has recently been paid...
A lot‐sizing and scheduling model for multi‐stage flow lines with zero lead times
A lot‐sizing and scheduling model for multi‐stage flow lines with zero lead times
2013,
We present a new model formulation for lot‐sizing and scheduling of...
On the Convergence Regions of Generalized Accelerated Overrelaxation Method for Linear Complementarity Problems
On the Convergence Regions of Generalized Accelerated Overrelaxation Method for Linear Complementarity Problems
2013,
In this paper, we use a generalized Accelerated Overrelaxation (GAOR) method and...
Strange behaviors of interior‐point methods for solving semidefinite programming problems in polynomial optimization
Strange behaviors of interior‐point methods for solving semidefinite programming problems in polynomial optimization
2012,
We observe that in a simple one‐dimensional polynomial optimization problem...
A relaxation method for solving systems with infinitely many linear inequalities
A relaxation method for solving systems with infinitely many linear inequalities
2012,
The problem of finding a feasible solution to a linear inequality system arises in...
Split Rank of Triangle and Quadrilateral Inequalities
Split Rank of Triangle and Quadrilateral Inequalities
2011,
A simple relaxation consisting of two rows of a simplex tableau is a...
A Geometric Perspective on Lifting
A Geometric Perspective on Lifting
2011,
Recently it has been shown that minimal inequalities for a continuous relaxation of...
Discretization of interior point methods for state constrained elliptic optimal control problems: optimal error estimates and parameter adjustment
Discretization of interior point methods for state constrained elliptic optimal control problems: optimal error estimates and parameter adjustment
2011,
An adjustment scheme for the relaxation parameter of interior point approaches to the...
A note on the MIR closure and basic relaxations of polyhedra
A note on the MIR closure and basic relaxations of polyhedra
2011,
Anderson et al. (2005) show that for a polyhedral mixed integer set defined by a...
Papers per page: