On Transportation Problems with Upper Bounds on Leading Rectangles
From MaRDI portal
Publication:3718481
Recommendations
Cited In (12)
- Greedy concepts for network flow problems
- A greedy algorithm for solving ordinary transportation problem with capacity constraints
- Monge and feasibility sequences in general flow problems
- Recognition of overlap graphs
- The performance of an eigenvalue bound on the max-cut problem in some classes of graphs
- Title not available (Why is no real title available?)
- An algorithm for the detection and construction of Monge sequences
- A simple greedy algorithm for a class of shuttle transportation problems
- Laplacian eigenvalues and the maximum cut problem
- Staircase transportation problems with superadditive rewards and cumulative capacities
- Perspectives of Monge properties in optimization
- Maximizing the value of a space mission
This page was built for publication: On Transportation Problems with Upper Bounds on Leading Rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3718481)