Pages that link to "Item:Q3362078"
From MaRDI portal
The following pages link to Combinatorial Algorithms for the Generalized Circulation Problem (Q3362078):
Displayed 15 items.
- Win-win match using a genetic algorithm (Q611494) (← links)
- Shortest path and maximum flow problems in networks with additive losses and gains (Q620954) (← links)
- Uncovering generalized-network structure in matrices (Q1308737) (← links)
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations (Q1598763) (← links)
- Improving time bounds on maximum generalised flow computations by contracting the network (Q1884873) (← links)
- Convex generalized flows (Q2352786) (← links)
- Recognizing a class of bicircular matroids (Q2367405) (← links)
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machines (Q2373738) (← links)
- Generalized max flow in series-parallel graphs (Q2445843) (← links)
- Maximum network flows with concave gains (Q2492702) (← links)
- A Strongly Polynomial Algorithm for Generalized Flow Maximization (Q2976148) (← links)
- Currency arbitrage detection using a binary integer programming model (Q3018462) (← links)
- An ε-Relaxation method for generalized separable convex cost network flow problems (Q4645915) (← links)
- Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains (Q5321689) (← links)
- A simple GAP-canceling algorithm for the generalized maximum flow problem (Q5901710) (← links)