Geodesic

Issue no. 1 Table of Contents

Stability aspects of multicriteria integer linear programming problems
p. 5-19
The second Riddel relation and its consequences
p. 20-32
On the number and arrangement of sensors for the multiple covering of bounded plane domains
p. 33-54
On a three-level competitive pricing problem with uniform and mill pricing strategies
p. 55-73
König graphs with respect to the 4-path and its spanning supergraphs
p. 74-88
Short complete fault detection tests for logic networks with fan-in two
p. 89-113
Polyhedral complementarity on a simplex: search for fixed points of decreasing regular mappings
p. 114-134

Issue no. 2 Table of Contents

A cut generation algorithm of finding an optimal solution in a market competition
p. 5-29
A polynomial $3/5$-approximate algorithm for the asymmetric maximization version of $3$-PSP
p. 30-59
A local search algorithm for the single machine scheduling problem with setups and a storage
p. 60-78
Estimating the stability radius of an optimal solution to the simple assembly line balancing problem
p. 79-97
On a construction of easily decodable sub-de Bruijn arrays
p. 98-114
Experimental methods for constructing MDS matrices of a special form
p. 115-128
Asymptotics for the logarithm of the number of $(k,l)$-solution-free collections in an interval of naturals
p. 129-144

Issue no. 3 Table of Contents

$2$-Factors without close edges in the $n$-dimensional cube
p. 5-26
A bilevel competitive location and pricing model with nonuniform split of demand
p. 27-45
On $m$-junctive predicates on a finite set
p. 46-59
The branch and cut method for the clique partitioning problem
p. 60-87
Adaptive mirror descent algorithms for convex and strongly convex optimization problems with functional constraints
p. 88-114
On the minimization of Boolean functions for additive complexity measures
p. 115-140

Issue no. 4 Table of Contents

Maximum intersection of linear codes and codes equivalent to linear
p. 5-15
A bilevel “Attacker–Defender” model to choosing the composition of attack means
p. 16-33
Undominatedness of equilibria in a mixed economy of Arrow–Debreu type
p. 34-55
Complexity of cyclic job shop scheduling problems for identical jobs with no-wait constraints
p. 56-73
On the perfectness of minimal regular partitions of the edge set of the $n$-dimensional cube
p. 74-107
On a relation between the depth and complexity of monotone Boolean formulas
p. 108-120
Relationship between homogeneous bent functions and Nagy graphs
p. 121-131