Files @ r839:f3bc4e9b5f3a

Location: LEMON/LEMON-main/lemon/lp_base.cc

Load file history 
r839:f3bc4e9b5f3a
937 B
text/x-c++src
Show annotation Show as raw Download as raw
gravatar
kpeter (Peter Kovacs)
New heuristics for MCF algorithms (#340) and some implementation improvements. - A useful heuristic is added to NetworkSimplex to make the initial pivots faster. - A powerful global update heuristic is added to CostScaling and the implementation is reworked with various improvements. - Better relabeling in CostScaling to improve numerical stability and make the code faster. - A small improvement is made in CapacityScaling for better delta computation. - Add notes to the classes about the usage of vector<char> instead of vector<bool> for efficiency reasons.
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
/* -*- mode: C++; indent-tabs-mode: nil; -*-

 *

 * This file is a part of LEMON, a generic C++ optimization library.

 *

 * Copyright (C) 2003-2008

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

 *

 * Permission to use, modify and distribute this software is granted

 * provided that this copyright notice appears in all copies. For

 * precise terms see the accompanying LICENSE file.

 *

 * This software is provided "AS IS" with no warranty of any kind,

 * express or implied, and with no claim as to its suitability for any

 * purpose.

 *

 */



///\file

///\brief The implementation of the LP solver interface.



#include <lemon/lp_base.h>

namespace lemon {



  const LpBase::Value LpBase::INF =

    std::numeric_limits<LpBase::Value>::infinity();

  const LpBase::Value LpBase::NaN =

    std::numeric_limits<LpBase::Value>::quiet_NaN();



} //namespace lemon