Results 231 to 240 of about 22,543 (264)
Some of the next articles are maybe not open access.
Integer Programs and Valid Inequalities for Planning Problems
2000Part of the recent work in AI planning is concerned with the development of algorithms that regard planning as a combinatorial search problem. The underlying representation language is basically propositional logic. While this is adequate for many domains, it is not clear if it remains so for problems that involve numerical constraints, or optimization
Alexander Bockmayr, Yannis Dimopoulos
openaire +2 more sources
Necessary and sufficient conditions for the validity of Jensen’s inequality
Archiv der Mathematik, 2013The authors established some improvements for several known results relative to the \(n\)-dimensional Jensen's inequality [\textit{J. E. McShane}, Bull. Am. Math. Soc. 43, 521--527 (1937; Zbl 0017.16003; JFM 63.0160.01)].
Guessab, A., Schmeisser, G.
openaire +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
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
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
Valid inequalities for the synchronization bus timetabling problem
European Journal of Operational Research, 2016Bus transit network planning is a complex process that is divided into several phases such as: line planning, timetable generation, vehicle scheduling, and crew scheduling. In this work, we address the timetable generation which consists in scheduling the departure times for all trips of each bus line.
Fouilhoux, Pierre +3 more
openaire +4 more sources