Showing items 1 - 20 of 34

Your selections:

A lower bound on the zero forcing number

A polynomially solvable case of the pooling problem

A reclaimer scheduling problem arising in coal stockyard management

A social welfare optimal sequential allocation procedure

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

Coalitional manipulation for Schulze's rule

Extended formulations for convex hulls of some bilinear functions

Feasible bases for a polytope related to the Hamilton cycle problem

H-supermagic labelings for firecrackers, banana trees and flowers

Hamiltonian cycles and subsets of discounted occupational measures

Incremental network design with maximum flows

Incremental network design with minimum spanning trees

Incremental network design with shortest paths

Maintenance scheduling in a railway corridor

Maximal antichains of minimum size

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

Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming

Minimum rank and zero forcing number for butterfly networks

Mixed integer programming based maintenance scheduling for the Hunter Valley coal chain

New multi-commodity flow formulations for the pooling problem

  • Disclaimer
  • Privacy
  • Copyright
  • Contact
  • Deposit