or-tools/src/graph/min_cost_flow.cc File Reference

#include "graph/min_cost_flow.h"
#include <math.h>
#include <algorithm>
#include <limits>
#include "base/commandlineflags.h"
#include "base/stringprintf.h"
#include "base/mathutil.h"
#include "graph/max_flow.h"

Go to the source code of this file.

Namespaces
namespace	operations_research
Functions
	DEFINE_int64 (min_cost_flow_alpha, 5,"Divide factor for epsilon at each refine step.")
	Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License.
	DEFINE_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.")
	DEFINE_bool (min_cost_flow_check_balance, true,"Check that the sum of supplies is equal to the sum of demands.")
	DEFINE_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")
	DEFINE_bool (min_cost_flow_fast_potential_update, true,"Fast node potential update. Faster when set to true, but does not""detect as many infeasibilities as when set to false.")
	DEFINE_bool (min_cost_flow_check_result, true,"Check that the result is valid.")

---

Function Documentation

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

DEFINE_bool	(	min_cost_flow_fast_potential_update	,
		true	,
		"Fast node potential update. Faster when set to	true,
		but does not""detect as many infeasibilities as when set to false."
	)

DEFINE_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"
	)

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

DEFINE_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."
	)

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

Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License.

You may obtain a copy of the License at

http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.