Results 191 to 200 of about 3,681 (231)
Some of the next articles are maybe not open access.
European Journal of Operational Research, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
József Dombi 0001 +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
József Dombi 0001 +2 more
openaire +1 more source
Lexicographical Order in Integer Programming
Vietnam Journal of Mathematics, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Labbé, Martine +2 more
openaire +3 more sources
Lexicographic Order and Linearity
Designs, Codes and Cryptography, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Soft Constraints for Lexicographic Orders
2013While classical Constraint Satisfaction Problems (CSPs) concern the search for the boolean assignment of a set of variables that has to satisfy some given requirements, their soft variant considers ordered domains for assignments, thus modeling preferences: the aim is to provide an environment where suitable algorithms (e.g.
GADDUCCI, FABIO +3 more
openaire +1 more source
Randić index and lexicographic order
Journal of Mathematical Chemistry, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Araujo, Oswaldo, Rada, Juan
openaire +1 more source
Iterative Lexicographic Path Orders
2006We relate Kamin and Levy’s original presentation of lexicographic path orders (LPO), using an inductive definition, to a presentation, which we will refer to as iterative lexicographic path orders (ILPO), based on Bergstra and Klop’s definition of recursive path orders by way of an auxiliary term rewriting sytem.
Jan Willem Klop +2 more
openaire +3 more sources
Matrices with lexicographically-ordered rows
Optimization Letters, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
The worst order in not always the lexicographic order
ACM SIGSAM Bulletin, 1991Consider I an homogeneous ideal in S = k [ x 0 ,..., x n ], where k is a field of characteristic zero. For any multiplicative order > on
openaire +1 more source
Global Constraints for Lexicographic Orderings
2002We propose some global constraints for lexicographic orderings on vectors of variables. These constraints are very useful for breaking a certain kind of symmetry arising in matrices of decision variables. We show that decomposing such constraints carries a penalty either in the amount or the cost of constraint propagation. We therefore present a global
Alan M. Frisch +4 more
openaire +1 more source
Extreme Choices on Complete Lexicographic Orders
Mathematical Logic Quarterly, 1991We work in Zermelo-Fraenkel set theory without the axiom of choice. For each linearly ordered set \((X,
openaire +2 more sources