Results 181 to 190 of about 2,766,432 (214)
Some of the next articles are maybe not open access.
International Journal of Electrical Power and Energy Systems, 2014
Ran Quan, Jin-Bao Jian
exaly +2 more sources
Ran Quan, Jin-Bao Jian
exaly +2 more sources
Valid inequalities for a class of assembly system problems
European Journal of Operational Research, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anulark Pinnoi, Wilbert E. Wilhelm
openaire +2 more sources
Other Valid Inequalities and Facets
1997We describe in this chapter the other main known classes of valid inequalities defining facets of the cut polytope. The complete linear description of the cut polytope CUT n □ is known only for n ≤ 7; it is presented in Section 30.6.
Michel Marie Deza, Monique Laurent
openaire +1 more source
Valid Inequalities for the Lasdon-Terjung Production Model
The Journal of the Operational Research Society, 1992Summary: We consider a very simple integer program involving production of a single item and start-up costs for the standard machines first studied by Lasdon and Terjung. Solving directly as an integer program leads to prohibitively large branch and bound trees.
Vanderbeck, François +1 more
openaire +2 more sources
The equipartition polytope. II: Valid inequalities and facets
Mathematical Programming, 1990[For part I see the authors, ibid. 49, No.1, 49-70 (1990; Zbl 0718.90092).] In this second part further facet inducing inequalities of the equicut polytope are described.
M. Conforti, M. R. Rao, SASSANO, Antonio
openaire +4 more sources
On the validity of the Clausius-Duhem inequality
Pure and Applied Chemistry, 1970The author discusses the applicability of various theories for describing processes in continuous matter and deals in some detail with the entropy-free thermodynamics of irreversible processes, basing his discourse on the work of J. Meixner in this field.
openaire +1 more source
The generalized assignment problem: Valid inequalities and facets
Mathematical Programming, 1990The authors present various classes of valid inequalities and study properties of facet defining inequalities for the polytope associated with the generalized assignment problem. It is proved that a basic fractional solution to the linear programming relaxation can be eliminated by a facet associated with an individual knapsack constraint.
Elsie Sterbin Gottlieb, M. R. Rao
openaire +2 more sources
Operations on Valid Inequalities and Facets
1997In this chapter we present several operations on valid inequalities and facets of the cut polytope. One of the basic properties of the cut polytope CUT n □ is that all its facets can be deduced from the facets of the cut cone CUT n using the so-called switching operation (cf. Section 26.3.2).
Michel Marie Deza, Monique Laurent
openaire +1 more source
New valid inequalities and formulations for the static joint Chance-constrained Lot-sizing problem
Mathematical programming, 2022Zeyang Zhang +2 more
semanticscholar +1 more source
Valid Inequality Based Lower Bounds for WCSP
2007Most of efficient WCSP solving methods are based on arc consistency notion used to transform a WCSP into an equivalent one easier to solve. There are several forms of arc consistency : AC* [9], DAC* [8], FDAC* [8], EDAC* [4]. Recently, an Optimal Soft Arc Consistency (OSAC) was proposed [2].
Mohand Ou Idir Khemmoudj +1 more
openaire +1 more source