Results 191 to 200 of about 2,766,432 (214)
Some of the next articles are maybe not open access.

Valid Inequalities for Separable Concave Constraints with Indicator Variables

Mathematical Programming, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cong Han Lim   +2 more
openaire   +1 more source

Lot-Sizing with Constant Batches: Formulation and Valid Inequalities

Mathematics of Operations Research, 1993
We consider the classical lot-sizing problem with constant production capacities (LCC) and a variant in which the capacity in each period is an integer multiple of some basic batch size (LCB). We first show that the classical dynamic program for LCC simplifies for LCB leading to an O(n2 min{n, C}) algorithm (where n is the number of periods and C the
Yves Pochet, Laurence A. Wolsey
openaire   +2 more sources

On the validity of the Cauchy–Schwarz inequality for the bracket map [PDF]

open access: possibleGlasnik Matematicki
Due to its properties, the bracket map associated with a dual integrable unitary representation of a locally compact group can be viewed as a certain operator-valued inner product; however, in the non-commutative setting, the Cauchy–Schwarz property for bracket is no longer present in its full strength.
openaire   +2 more sources

Bilevel Programming and Maximally Violated Valid Inequalities. [PDF]

open access: possible, 2009
In recent years, branch-and-cut algorithms have become firmly established as the most effective method for solving generic mixed integer linear programs (MIPs). Methods for automatically generating inequalities valid for the convex hull of solutions to such MIPs are a critical element of branch-and-cut.
LODI, ANDREA, T. K. Ralphs
openaire   +1 more source

Valid Inequalities and Superadditivity for 0–1 Integer Programs

Mathematics of Operations Research, 1977
It is shown that valid inequalities for 0–1 problems can be essentially characterized by two underlying functions, one of which is superadditive. These functions are essential to the characterization of maximal inequalities, the projection of valid inequalities and the definition of a master polytope. Similar properties are shown to hold for 0–1 group
openaire   +1 more source

Strong Valid Inequalities

Integer Programming, 2020

semanticscholar   +1 more source

Strong valid inequalities for Boolean logical pattern generation

Journal of Global Optimization, 2017
Kedong Yan, H. Ryoo
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy