Showing papers in "Electronic Notes in Discrete Mathematics in 2017"
••
TL;DR: A new way of constructing deterministic polynomial-time approximation algorithms for computing complex-valued evaluations of a large class of graph polynomials on bounded degree graphs is shown.
87 citations
••
TL;DR: In this paper, it is assumed that the products are transferred in batches in a fixed charge transportation problem, and the Taguchi method is used.
56 citations
••
TL;DR: Experiments conducted on benchmark instances from the literature clearly show that the method is fast and outperforms the existing approaches on half of the instances.
49 citations
••
TL;DR: The experimental results indicate that the proposed algorithm provides superior solutions for well-known benchmark problems compared to those reported in the literature.
40 citations
••
TL;DR: A three-phase matheuristic, combining an exact method with a Variable Neighborhood Search local Branching (VNSB) to route a fleet of Electric Vehicles (EVs) to hierarchically minimize the number of EVs used and the total time spent by the EVs.
37 citations
••
TL;DR: A mixed integer programming formulation for the problem of scheduling preventive railway maintenance activities and a Variable Neighborhood Search (VNS) algorithm to solve large instances of the problem are proposed.
27 citations
••
TL;DR: The value of modularity is investigated in several well-known random graph models by measuring the strength of division of a network into clusters (or communities).
24 citations
••
TL;DR: It is proved that every digraph on n vertices with minimum outdegree 0:3465n contains an oriented triangle, which improves the bound of 0:3532n of Hamburger, Haxell and Kostochka.
19 citations
••
TL;DR: It is shown that if H contains a certain multigraph as a minor, then H-graphs are GI -complete and the clique problem is APX -hard, and treewidth is used to show that both the k-clique and list k-coloring problems are FPT on H- graphs.
18 citations
••
TL;DR: A general approach is introduced for studying the appearance of spanning subgraphs in this model of randomly perturbed dense graphs, which is called assisted absorption and yields simpler proofs of several known results.
17 citations
••
TL;DR: This work presents a Variable Neighborhood Search accelerated Column Generation procedure for the NRP in addition to a Relax-and-fix Heuristic for obtaining feasible solutions.
••
TL;DR: The results of computational experiments on standard p-hub benchmark instances show the efficiency and effectiveness of the proposed GVNS when solving the considered problem.
••
TL;DR: A local version of the forcing conjecture holds locally for H if and only if H has even girth or is a forest, and it is proved that for such H there is δ H > 0 such that Sidorenko's conjecture and theforcing conjecture holds for all p > 1 −δ H .
••
TL;DR: In this article, the authors focus on boolean dimension and local dimension, and determine precisely which values of dimension/boolean dimension/local dimension imply that the two other parameters are bounded.
••
TL;DR: This paper designs an integrated transportation solver for the Vehicle Routing Problem with Time Windows and proposes a VND approach, which provided better results, in terms of solution quality, than existing approaches results.
••
TL;DR: Some interplay between the algebraic properties of a group and the graph theory properties of its (directed and undirected) reduced power graphs is studied.
••
TL;DR: This work studies a new variant of the bin packing problem that wants to pack all items into the minimal number of bins and applies the column generation technique based on the VNS matheuristic for the pricing problem.
••
TL;DR: This work studies cospectrality from the point of view of pebble games, which are certain type of combinatorial games used in Finite Model Theory to capture the notion of elementary equivalence induced by various logic.
••
TL;DR: In this article, the authors derive the enumeration and limit laws of lattice paths with catastrophes for any finite set of jumps and prove several formulae for related combinatorial structures conjectured in the On-line Encyclopedia of Integer Sequences.
••
TL;DR: A hybrid parallel VNS method is applied to recent benchmark problem instances for the multi-product dynamic lot sizing problem with product returns and recovery, which appears in reverse logistics and is known to be NP-hard.
••
TL;DR: It is proved that the maximum number of triangles in a C5-free graph on n vertices is at most 1 2 2 ( 1 + o ( 1 ) ) n 3 / 2 , improving an estimate of Alon and Shikhelman.
••
TL;DR: In this paper, it was shown that if k ≥ 3 and s ≥ 2 k 2, then every k-uniform hypergraph on n vertices with minimum codegree at least ( 1 / 2 + 1 / ( 2 s ) + o ( 1 ) ) n has a perfect C s k -tiling.
••
TL;DR: A new local search method for solving automatic programming problem and it is used within recent Variable Neighborhood Programming (VNP) method to adapt well known “elementary tree transformation” in generating neighboring trees (programs) N (T) to the incumbent tree T.
••
TL;DR: The sharp minimum ( k − 2 )-degree bound for a k-uniform hypergraph H on n vertices to contain a Hamiltonian l-cycle if k − l divides n and n is sufficiently large is proved.
••
TL;DR: The codegree threshold ex2(n, F) of a non-empty 3-graph F is the minimum d = d(n) such that every 3- graph on n vertices in which every pair of vertices is contained in at least d+ 1 edges contains d- 1 edges.
••
TL;DR: A reduced variable neighborhood search for automatic configuration is explored as an alternative for the one-exchange neighborhood that is searched in the local search phase of ParamILS.
••
TL;DR: A few formulae enumerating polyominoes with a fixed deviation from the maximum possible perimeter are presented.
••
TL;DR: For any d ∈ N, for any k ≥ 3, there is an explicit c d > 1 such that χ d ( R n ) ≥ ( c d + o ( 1 ) ) n, whereπ� d is the minimum number of colors needed to color all points in R n so that there is no monochromatic set of vertices of a d-dimensional regular simplex.
••
TL;DR: The characteristic polynomial of the degree exponent matrix of graphs obtained by some graph operations is obtained.
••
TL;DR: Bal and DeBiasio as mentioned in this paper showed that every r -colouring of the edge set of a graph G yields r pairwise vertex disjoint monochromatic trees that partition the whole vertex set of G.