Minimal infeasible constraint sets in convex integer programs

Authors:
Wiesława T. Obuchowska
Affiliations:
Department of Mathematics, East Carolina University, Greenville, USA 27858
Venue:
Journal of Global Optimization
Year:
2010

Citing 8
Cited 0

Theory of linear and integer programming

Theory of linear and integer programming
Integer and combinatorial optimization

Integer and combinatorial optimization
On Projection Algorithms for Solving Convex Feasibility Problems

SIAM Review
Analyzing Infeasible Mixed-Integer and Integer Linear Programs

INFORMS Journal on Computing
On Generalizations of the Frank-Wolfe Theorem to Convex and Quasi-Convex Programmes

Computational Optimization and Applications
Discrete global descent method for discrete global optimization and nonlinear integer programming

Journal of Global Optimization
Active-constraint variable ordering for faster feasibility of mixed integer linear programs

Mathematical Programming: Series A and B
Feasibility and Infeasibility in Optimization: Algorithms and Computational Methods

Feasibility and Infeasibility in Optimization: Algorithms and Computational Methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce an iterative sequence for finding a common element of the set of fixed points of a relatively weak nonexpansive mapping and the set of solutions of a variational inequality in a Banach space. Our results extend and improve ...