Hutchison linear programming and network flow 24 questions completed

Copyright: Reprinted marked out. . https://blog.csdn.net/huashuimu2003/article/details/91410573

reason

$\quad$After about half the time it can be regarded as completed the first phase of this task, the network flow 24 questions all write again, after completion, I managed to write only from a board into a konjac know some modeling konjac, so close-up Cipian $blog$ , as a memorial.

suggestion

1. The maximum flow or school board $Dinic$ bar, $A$ may be the card, $SAP$ heard. Cost flow on board with $A$ modified it, this way, $A$ can be considered learned, of course, to learn bigwigs $zkw$ charges then flow better. .
2. Of course, to try to solve problems independently, it does not, you can see the solution to a problem, but to ensure that the model behind this question can be understood, the face of the same model, the solution can think of network flow model 24 questions in really the same, not even the details title changed .
3. For the robot path planning that question, I find from the Internet $IDA *$ to write, to be honest, I still half-ignorant state, related papers are in English, so I feel then a chicken dish English?
4. List it listed questions which can be considered my proposal? , By (chao) Kam (xi) at $BYVoid$ God Ben friends.

Knowledge chart

QUESTION	Name issue	Model problem	Transformation Model
1	The pilot program pairing problems	Bipartite graph maximum matching	Network maximum flow
2	Space flight plan issue	Maximum weight closure map	Network minimal cut
3	Minimum path cover problem	Covering a minimum path directed acyclic graph	Network maximum flow
4	Magic Ball problems	Covering a minimum path directed acyclic graph	Network maximum flow
5	Roundtable problem	FIG multiple match bipartite	Network maximum flow
6	The longest increasing subsequence problem	Up to disjoint paths	Network maximum flow
7	Test database problem	FIG multiple match bipartite	Network maximum flow
8	Robot path planning problem	(unsolved)	The minimum cost maximum flow
9	Grid access issues	The maximum weight bipartite graph independent set point	Network minimal cut
10	Napkins planning problem	Linear Programming Network Optimization	The minimum cost maximum flow
11	Air Routes	Longest disjoint paths	The minimum cost maximum flow
12	Software patch problem	The minimum cost of transfer	Shortest Path
13	Star Transfer	Network Determination	Network maximum flow
14	Island rescue problem	FIG hierarchical shortest path	Shortest Path
15	Vehicle refueling problem	FIG hierarchical shortest path	Shortest Path
16	Digital Keystone problem	Maximum weight disjoint paths	The minimum cost maximum flow
17	Transportation issues	Network traffic costs	The minimum cost maximum flow
18	Allocation	FIG best match bipartite	The minimum cost maximum flow
19	Load balancing	The minimum cost of supply and demand	The minimum cost maximum flow
20	Deep-sea robot problem	Linear Programming Network Optimization	The minimum cost maximum flow
21	Longest interval k may set a weight problem	Maximum weight disjoint paths	The minimum cost maximum flow
22	K longest segment re-set problem	Maximum weight disjoint paths	The minimum cost maximum flow
23	Mars Pathfinder problem	Linear Programming Network Optimization	The minimum cost maximum flow
24	Knight coexistence issues	Bipartite graph maximum independent set	Network minimal cut