Showing items 1 - 20 of 34

Your selections:

Total Edge Irregularity Strength of The Cartesian Product of Bipartite Graphs and Paths

Feasible bases for a polytope related to the Hamilton cycle problem

Extended formulations for convex hulls of some bilinear functions

Hamiltonian cycles and subsets of discounted occupational measures

Scheduling of maintenance windows in a mining supply chain rail network

Minimum rank and zero forcing number for butterfly networks

Zero forcing in iterated line digraphs

A lower bound on the zero forcing number

On the power domination number of de Bruijn and Kautz digraphs

Resource considerations for integrated planning of railway traffic and maintenance windows

A polynomially solvable case of the pooling problem

Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions

H-supermagic labelings for firecrackers, banana trees and flowers

Incremental network design with minimum spanning trees

Maintenance scheduling in a railway corridor

Scheduling reclaimers serving a stock pad at a coal terminal

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

The network maintenance problem

A reclaimer scheduling problem arising in coal stockyard management

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

  • Disclaimer
  • Privacy
  • Copyright
  • Contact
  • Deposit