Given an undirected graph and a positive integer k, the maximum k-colorable subgraph problem consists of selecting a k-colorable induced subgraph of maximum cardinality. The natural integer programming formulation for this problem exhibits two kinds of symmetry: arbitrarily permuting the color classes and/or applying a nontrivial graph automorphism gives equivalent solutions. It is well known t...

This study focuses on the multiobjectivity in the off-line routing of QoS traffic in MultiProtocol Label Switching (MPLS) Networks. The routing problem is formulated as a multiobjective mixed-integer programming. It aims at exploring the trade-offs between three objectives, namely minimal routing delay, optimal load-balance in the network, and minimal splitting of traffic trunks. For the multio...

Abstract In this article, we address a fully fuzzy triangular linear fractional programming (FFLFP) problem under the condition that all parameters and decision variables are characterized by numbers. Utilizing computation of numbers Lexicographic order (LO), FFLFP is changed over to multi-objective function. Consequently, into crisp problem. This paper outfits another idea for diminishing comp...

KBlab is a Completion based theorem prover for equational logic, written in the language C and developed on the Macintosh in the MPW (Macintosh Programmer Workshop) programming environment. The core of KBlab is the Knuth–Bendix Completion Procedure (KB) [9,7,1], extended to Unfailing Knuth– Bendix (UKB) [5], S–strategy [5] and inductive theorem proving (IKB). IKB implements the Huet–Hullot meth...

Multi-Objective Combinatorial Optimization (MOCO) problems find a wide range of practical application problems, some of which involving Boolean variables and constraints. This paper develops and evaluates algorithms for solving MOCO problems, defined on Boolean domains, and where the optimality criterion is lexicographic. The proposed algorithms build on existing algorithms for either Maximum S...

We introduce syntactic restrictions of the lexicographic path ordering to obtain the Light Lexicographic Path Ordering. We show that the light lexicographic path ordering leads to a characterisation of the functions computable in space bounded by a polynomial in the size of the inputs.

In this paper we consider the problem of finding bounds on the size of lexicographic constant-weight equidistant codes over the alphabet of three, four and five elements with 2 ≤ w < n ≤ 10. Computer search of lexicographic constant-weight equidistant codes is performed. Tables with bounds on the size of lexicographic constant-weight equidistant codes are presented.