Showing items 1 - 20 of 33

Your selections:

H-supermagic labelings for firecrackers, banana trees and flowers

Resource considerations for integrated planning of railway traffic and maintenance windows

Feasible bases for a polytope related to the Hamilton cycle problem

Scheduling of maintenance windows in a mining supply chain rail network

Scheduling reclaimers serving a stock pad at a coal terminal

Incremental network design with maximum flows

Strategic behavior when allocating indivisible goods sequentially

Maximal antichains of minimum size

Minimizing the regularity of maximal regular antichains of 2- and 3-sets

A social welfare optimal sequential allocation procedure

Extended formulations for convex hulls of some bilinear functions

The metric dimension of the circulant graph C(n,±{1,2,3,4})

On the power domination number of de Bruijn and Kautz digraphs

Coalitional manipulation for Schulze's rule

Minimum rank and zero forcing number for butterfly networks

Zero forcing in iterated line digraphs

Maintenance scheduling in a railway corridor

Hamiltonian cycles and subsets of discounted occupational measures

Incremental network design with minimum spanning trees

A lower bound on the zero forcing number

  • Disclaimer
  • Privacy
  • Copyright
  • Contact
  • Deposit