Files @ r651:8c3112a66878

Location: LEMON/LEMON-official/lemon/soplex.h

Load file history 
r651:8c3112a66878
4.2 KiB
text/x-chdr
Show annotation Show as raw Download as raw
gravatar
kpeter (Peter Kovacs)
Use XTI implementation instead of ATI in NetworkSimplex (#234) XTI (eXtended Threaded Index) is an imporved version of the widely known ATI (Augmented Threaded Index) method for storing and updating the spanning tree structure in Network Simplex algorithms. In the ATI data structure three indices are stored for each node: predecessor, thread and depth. In the XTI data structure depth is replaced by the number of successors and the last successor (according to the thread index).
  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
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
/* -*- 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.

 *

 */



#ifndef LEMON_SOPLEX_H

#define LEMON_SOPLEX_H



///\file

///\brief Header of the LEMON-SOPLEX lp solver interface.



#include <vector>

#include <string>



#include <lemon/lp_base.h>



// Forward declaration

namespace soplex {

  class SoPlex;

}



namespace lemon {



  /// \ingroup lp_group

  ///

  /// \brief Interface for the SOPLEX solver

  ///

  /// This class implements an interface for the SoPlex LP solver.

  /// The SoPlex library is an object oriented lp solver library

  /// developed at the Konrad-Zuse-Zentrum f�r Informationstechnik

  /// Berlin (ZIB). You can find detailed information about it at the

  /// <tt>http://soplex.zib.de</tt> address.

  class SoplexLp : public LpSolver {

  private:



    soplex::SoPlex* soplex;



    std::vector<std::string> _col_names;

    std::map<std::string, int> _col_names_ref;



    std::vector<std::string> _row_names;

    std::map<std::string, int> _row_names_ref;



  private:



    // these values cannot be retrieved element by element

    mutable std::vector<Value> _primal_values;

    mutable std::vector<Value> _dual_values;



    mutable std::vector<Value> _primal_ray;

    mutable std::vector<Value> _dual_ray;



    void _clear_temporals();



  public:



    /// \e

    SoplexLp();

    /// \e

    SoplexLp(const SoplexLp&);

    /// \e

    ~SoplexLp();



  protected:



    virtual SoplexLp* _newSolver() const;

    virtual SoplexLp* _cloneSolver() const;



    virtual const char* _solverName() const;



    virtual int _addCol();

    virtual int _addRow();



    virtual void _eraseCol(int i);

    virtual void _eraseRow(int i);



    virtual void _eraseColId(int i);

    virtual void _eraseRowId(int i);



    virtual void _getColName(int col, std::string& name) const;

    virtual void _setColName(int col, const std::string& name);

    virtual int _colByName(const std::string& name) const;



    virtual void _getRowName(int row, std::string& name) const;

    virtual void _setRowName(int row, const std::string& name);

    virtual int _rowByName(const std::string& name) const;



    virtual void _setRowCoeffs(int i, ExprIterator b, ExprIterator e);

    virtual void _getRowCoeffs(int i, InsertIterator b) const;



    virtual void _setColCoeffs(int i, ExprIterator b, ExprIterator e);

    virtual void _getColCoeffs(int i, InsertIterator b) const;



    virtual void _setCoeff(int row, int col, Value value);

    virtual Value _getCoeff(int row, int col) const;



    virtual void _setColLowerBound(int i, Value value);

    virtual Value _getColLowerBound(int i) const;

    virtual void _setColUpperBound(int i, Value value);

    virtual Value _getColUpperBound(int i) const;



    virtual void _setRowLowerBound(int i, Value value);

    virtual Value _getRowLowerBound(int i) const;

    virtual void _setRowUpperBound(int i, Value value);

    virtual Value _getRowUpperBound(int i) const;



    virtual void _setObjCoeffs(ExprIterator b, ExprIterator e);

    virtual void _getObjCoeffs(InsertIterator b) const;



    virtual void _setObjCoeff(int i, Value obj_coef);

    virtual Value _getObjCoeff(int i) const;



    virtual void _setSense(Sense sense);

    virtual Sense _getSense() const;



    virtual SolveExitStatus _solve();

    virtual Value _getPrimal(int i) const;

    virtual Value _getDual(int i) const;



    virtual Value _getPrimalValue() const;



    virtual Value _getPrimalRay(int i) const;

    virtual Value _getDualRay(int i) const;



    virtual VarStatus _getColStatus(int i) const;

    virtual VarStatus _getRowStatus(int i) const;



    virtual ProblemType _getPrimalType() const;

    virtual ProblemType _getDualType() const;



    virtual void _clear();



  };



} //END OF NAMESPACE LEMON



#endif //LEMON_SOPLEX_H