min_cost_flow.cc File Reference

Go to the source code of this file.

Namespaces
	operations_research
	The vehicle routing library lets one model and solve generic vehicle routing problems ranging from the Traveling Salesman Problem to more complex problems such as the Capacitated Vehicle Routing Problem with Time Windows.

Functions
	ABSL_FLAG (int64, min_cost_flow_alpha, 5, "Divide factor for epsilon at each refine step.")
	ABSL_FLAG (bool, min_cost_flow_check_feasibility, true, "Check that the graph has enough capacity to send all supplies " "and serve all demands. Also check that the sum of supplies " "is equal to the sum of demands.")
	ABSL_FLAG (bool, min_cost_flow_check_balance, true, "Check that the sum of supplies is equal to the sum of demands.")
	ABSL_FLAG (bool, min_cost_flow_check_costs, true, "Check that the magnitude of the costs will not exceed the " "precision of the machine when scaled (multiplied) by the number " "of nodes")
	ABSL_FLAG (bool, min_cost_flow_check_result, true, "Check that the result is valid.")

Function Documentation

ABSL_FLAG() [1/5]

ABSL_FLAG	(	bool	,
		min_cost_flow_check_balance	,
		true	,
		"Check that the sum of supplies is equal to the sum of demands."
	)

ABSL_FLAG() [2/5]

ABSL_FLAG	(	bool	,
		min_cost_flow_check_costs	,
		true	,
		"Check that the magnitude of the costs will not exceed the " "precision of the machine when scaled (multiplied) by the number " "of nodes"
	)

ABSL_FLAG() [3/5]

ABSL_FLAG	(	bool	,
		min_cost_flow_check_feasibility	,
		true	,
		"Check that the graph has enough capacity to send all supplies " "and serve all demands. Also check that the sum of supplies " "is equal to the sum of demands."
	)

ABSL_FLAG() [4/5]

ABSL_FLAG	(	bool	,
		min_cost_flow_check_result	,
		true	,
		"Check that the result is valid."
	)

ABSL_FLAG() [5/5]

ABSL_FLAG	(	int64	,
		min_cost_flow_alpha	,
		5	,
		"Divide factor for epsilon at each refine step."
	)