Results 251 to 260 of about 350,084 (285)
Some of the next articles are maybe not open access.
Characterizing Stable and Deriving Valid Inequalities of Petri Nets
Fundamenta Informaticae, 2016One way to express correctness of a Petri net N is to specify a linear inequality U, requiring each reachable marking of N to satisfy U. A linear inequality U is stable if it is preserved along steps. If U is stable, then verifying correctness reduces to checking U in the initial marking of N.
Triebel, Marvin, Sürmeli, Jan
openaire +2 more sources
Generating Valid Inequalities and Facets Using RLT
1999Thus far, we have presented a hierarchy of relaxations leading up to the convex hull representation for zero-one mixed-integer programming problems, and have developed extensions of this hierarchy to accommodate inherent special structures as well as to handle general discrete (as opposed to simply 0–1) variables.
Hanif D. Sherali, Warren P. Adams
openaire +1 more source
The Capacitated Arc Routing Problem: Valid Inequalities and Facets
Computational Optimization and Applications, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Belenguer, J. M., Benavent, E.
openaire +2 more sources
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
Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
Mathematics of Operations Research, 1993We 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
Pochet, Yves, Wolsey, Laurence A.
openaire +2 more sources
Valid Inequalities for Separable Concave Constraints with Indicator Variables
Mathematical Programming, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cong Han Lim +2 more
openaire +1 more source
Valid inequalities for the k-Color Shortest Path Problem
European Journal of Operational ResearchzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rafael Castro de Andrade +2 more
openaire +2 more sources
Valid Inequalities and Superadditivity for 0–1 Integer Programs
Mathematics of Operations Research, 1977It 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
Bilevel programming and maximally violated valid inequalities
2009In 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 +3 more sources