Minotaur 0.4.1
Docs for developers
base Directory Reference
Directory dependency graph for base:
/home/amahajan/tmp/minotaur-test/src/base

Directories

directory  unused
 

Files

file  ActiveNodeStore.h [code]
 Declare the base class ActiveNodeStore for storing active nodes of the branch-and-bound tree.
 
file  AnalyticalCenter.cpp
 
file  AnalyticalCenter.h [code]
 
file  BndProcessor.cpp
 Implement simple node-processor for branch-and-bound.
 
file  BndProcessor.h [code]
 Define simple node-processor for branch-and-bound.
 
file  Branch.cpp
 Define the class Branch for describing branches in branch-and-bound.
 
file  Branch.h [code]
 Declare the class Branch for describing branches in branch-and-bound.
 
file  BranchAndBound.cpp
 Define BranchAndBound class for a generic branch-and-bound method.
 
file  BranchAndBound.h [code]
 Declare the BranchAndBound class for branch-and-bound-algorithm, BabStats class for statistics and BabOptions class for options.
 
file  Brancher.h [code]
 Declare the base class Brancher for finding and creating branches in Branch-and-Bound.
 
file  BrCand.cpp
 Define the classes BranchCand for storing candidates for branching.
 
file  BrCand.h [code]
 Declare the classes BranchCand storing candidates for branching.
 
file  BrVarCand.cpp
 Define the classes BrVarCand for storing candidates for branching on variables.
 
file  BrVarCand.h [code]
 Declare the classes BrVarCand storing candidates for branching.
 
file  CGraph.cpp
 Define class CGraph for storing computational graph of a nonlinear function.
 
file  CGraph.h [code]
 Declare class CGraph for storing computational graph of a nonlinear function.
 
file  Chol.h [code]
 
file  CNode.cpp
 Define class CNode for representing a node of computational graph of a nonlinear function.
 
file  CNode.h [code]
 Declare class CNode to represent node of a computational graph of a nonlinear function.
 
file  ConBoundMod.cpp
 Implement the Modification class ConBoundMod, that is used to store modifications to a bound on a constraint.
 
file  ConBoundMod.h [code]
 Declare the class ConBoundMod. It is used to save modifications in a bound of a constraint. Also declare ConBoundMod2 that is used to change both bounds of a constraint. Also declare ConMod that is used to change nonlinear part of the constraint.
 
file  Constraint.cpp
 Define the Constraint class.
 
file  Constraint.h [code]
 Get information about a constraint in a given Problem.
 
file  CoverCutGenerator.cpp
 Define base class CoverCutGenerator.
 
file  CoverCutGenerator.h [code]
 Declare base class CoverCutGenerator.
 
file  Cut.cpp
 Update information required by CutManager for each cut.
 
file  Cut.h [code]
 Declare the Cut class of valid inequalities.
 
file  CutInfo.cpp
 Implement the methods of Cut class.
 
file  CutInfo.h [code]
 Define the Cut class for valid inequalities and additional information.
 
file  CutMan1.cpp
 Implement the methods of CutMan1 class.
 
file  CutMan1.h [code]
 Manages addition and deletion of cuts to problem.
 
file  CutMan2.cpp
 Implement the methods of CutMan2 class.
 
file  CutMan2.h [code]
 Manages addition and deletion of cuts to problem.
 
file  CutManager.h [code]
 Manages addition and deletion of cuts to problem.
 
file  CutPool.h [code]
 Declare class CutPool for storing cuts.
 
file  CxQuadHandler.cpp
 Implement the handler for functions of the general quadratic form $ \sum_i x^TAx \leq b $, where $A$ may be indefinite.
 
file  CxQuadHandler.h [code]
 Define the CxQuadHandler class for handling convex quadratic objective functions and constraints.
 
file  CxUnivarHandler.cpp
 Implement the handler for functions of the general univariate convex form y=g(x).
 
file  CxUnivarHandler.h [code]
 Define the CxUnivarHandler class for handling convex univariate functions.
 
file  DistParBranchAndBound.cpp
 Define DistParBranchAndBound class for a distributed memory parallel branch-and-bound.
 
file  DistParBranchAndBound.h [code]
 Declare the distributed memory parallel branch-and-bound-algorithm.
 
file  Eigen.cpp
 Define class Eigen for computing eigen values and vectors of a matrix.
 
file  Eigen.h [code]
 Declare methods and data structures of Eigen class for computing eigen values and vectors of a matrix.
 
file  Engine.h [code]
 Define the base class Engine.
 
file  Environment.cpp
 Implement the Environment class.
 
file  Environment.h [code]
 Define the Environment class.
 
file  Exception.h [code]
 
file  FeasibilityPump.cpp
 Define the Feasibility Pump class for generating a feasible solution using FP heuristic for MINLPs.
 
file  FeasibilityPump.h [code]
 Declare the class FeasibilityPump derived from base class Heuristic.
 
file  FixVarsHeur.cpp
 Define the FixVarsHeur class for diving heuristics for MINLPs.
 
file  FixVarsHeur.h [code]
 Define the class FixVarsHeur derived from base class Heuristics.
 
file  Function.h [code]
 Get information about a Function.
 
file  Gradient.h [code]
 Get information about gradient of a function.
 
file  Handler.h [code]
 Define abstract base class for handlers of various kinds.
 
file  HessianOfLag.h [code]
 Declare class HessianOfLag to get information about hessian of Lagrangean of a Problem.
 
file  Heuristic.h [code]
 Define abstract base class for heuristics of various kinds.
 
file  HybridBrancher.cpp
 Define methods for Hybrid branching.
 
file  HybridBrancher.h [code]
 Declare methods and data structures for Hybrid branching.
 
file  IntVarHandler.cpp
 Define the IntVarHandler class for handling integer constrained variables. It checks integrality and provides branching candidates. Does not do any presolving and cut-generation.
 
file  IntVarHandler.h [code]
 Declare the IntVarHandler class for handling integer constrained variables. It checks integrality and provides branching candidates. Does not do any presolving and cut-generation.
 
file  Iterate.h [code]
 
file  Jacobian.h [code]
 Get information about Jacobian of a given Problem.
 
file  KnapCovHandler.h [code]
 Declare the KnapCovHandler class for handling knapsack cover constraints. It generates the cuts whenever they are needed.
 
file  KnapsackList.cpp
 Define base class KnapsackList.
 
file  KnapsackList.h [code]
 Declare base class KnapsackList.
 
file  kPowHandler.cpp
 Implement a handler for k power constraints of the form $ y = x^k $, where $ k > 1 $,.
 
file  kPowHandler.h [code]
 Declare a handler for simple Quadratic constraints of the form $ y_1 = x_1x_2 $, and $ y_1 = x_1^2 $, It does not handle any other Quadratic constraints.
 
file  LexicoBrancher.cpp
 Define methods for Lexicographic branching.
 
file  LexicoBrancher.h [code]
 Declare methods and data structures for lexicographic branching.
 
file  LGCIGenerator.cpp
 Declare base class LGCIGenerator.
 
file  LGCIGenerator.h [code]
 Declare base class KnapsackList.
 
file  LinBil.cpp
 Implement routines to store and modify linear constraints obtained by relexing bilinear constraints of the form $ y = x_1x_2 $,.
 
file  LinBil.h [code]
 Declare a class for storing linear under and overestimators of bilinear functions $ y_1 = x_1x_2 $,.
 
file  LinConMod.cpp
 Implement the Modification class LinConMod, that is used to store modifications to the linear parts and rhs of a constraint.
 
file  LinConMod.h [code]
 Declare the class LinConMod. It is used to save modifications in the linear functions of constraints.
 
file  LinearCut.cpp
 Implement the methods of LinearCut class.
 
file  LinearCut.h [code]
 Define the class of valid inequalities of the form $ ax \leq b$.
 
file  LinearFunction.h [code]
 Declare the class LinearFunction for storing and modifying a linear function.
 
file  LinearHandler.cpp
 Handle linear contraints, including simple bound constraints on variables. Implements methods for relaxing, presolving and separating. Should not be used for checking integrality or branching on variables.
 
file  LinearHandler.h [code]
 Declare the LinearHandler class for handling integer and continuous variables.
 
file  Linearizations.cpp
 
file  Linearizations.h [code]
 
file  LinFeasPump.cpp
 Implements the class Feasibility Pump.
 
file  LinFeasPump.h [code]
 Feasibility pump using Linear relaxation.
 
file  LinMods.cpp
 Implement the Modification class LinMods, that is used to store modifications to the linear parts and rhs of a constraint.
 
file  LinMods.h [code]
 Declare the class LinMods. It is used to save several modifications in the linear functions of constraints and changes in bounds of variables.
 
file  Logger.h [code]
 Declare class for creating logs.
 
file  LPEngine.h [code]
 Declare the class LPEngine for solving LPs and getting solution.
 
file  LPRelaxation.h [code]
 
file  MaxFreqBrancher.cpp
 Define methods for maximum-frequency branching.
 
file  MaxFreqBrancher.h [code]
 Declare methods and data structures for maximum-frequency branching.
 
file  MaxInfBrancher.cpp
 Define methods for hybrid-inference branching name as maxinf.
 
file  MaxInfBrancher.h [code]
 Declare methods and data structures for hybrid-inference score branching.
 
file  MaxVioBrancher.cpp
 Define methods for maximum violation branching candidate.
 
file  MaxVioBrancher.h [code]
 Declare methods and data structures for maximum violation branching.
 
file  MILPEngine.h [code]
 Declare the class MILPEngine for solving MILPs and getting solution.
 
file  MINLPDiving.cpp
 Define the MINLPDiving class for diving heuristics for MINLPs.
 
file  MINLPDiving.h [code]
 Define the class MINLPDiving derived from base class Heuristics.
 
file  MinotaurCFortran.h [code]
 
file  MinotaurDeconfig.h [code]
 
file  Modification.h [code]
 
file  MsProcessor.cpp
 Implement simple multi-start node-processor for branch-and-bound.
 
file  MsProcessor.h [code]
 Define multi-start node-processor for branch-and-bound.
 
file  MultilinearHandler.cpp
 Handles Multilinear Constraints.
 
file  MultilinearHandler.h [code]
 Declare the MultilinearHandler class for handling Multilinear constraints.
 
file  MultilinearTermsHandler.cpp
 Handles Multilinear Terms. Each term must appear as equal to some auxiliary variable.
 
file  MultilinearTermsHandler.h [code]
 A Handler for a general collection of MultilinearTerms.
 
file  MultiSolHeur.cpp
 Define the MultiSolHeur class for generating a feasible solution using NLP and MILP solves for MINLPs.
 
file  MultiSolHeur.h [code]
 Declare the class MultiSolHeur derived from base class Heuristic.
 
file  NLPEngine.h [code]
 Declare NLPEngine Class for solving nonlinear problems using a nonlinear solver.
 
file  NLPMultiStart.cpp
 Multi start heuristic for continuous NLPs.
 
file  NLPMultiStart.h [code]
 Define a derived class from class Heuristic for multistart heuristic.
 
file  NLPRelaxation.cpp
 Implement methods and functions of an NLP Relaxation.
 
file  NLPRelaxation.h [code]
 
file  NlPresHandler.cpp
 Presolve nonlinear contraints.
 
file  NlPresHandler.h [code]
 Declare the NlPresHandler class for try some NLP presolve ideas.
 
file  NlWriter.cpp
 write an nl file
 
file  NlWriter.h [code]
 Declare class NlWriter for writing nl files.
 
file  Node.cpp
 Define class Node for storing information about nodes.
 
file  Node.h [code]
 Define base class Node.
 
file  NodeFullRelaxer.cpp
 Define the class NodeFullRelaxer.
 
file  NodeFullRelaxer.h [code]
 Declare the NodeFullRelaxer class. It creates relaxation by fully recreating the relaxation at each node.
 
file  NodeHeap.cpp
 Define class NodeHeap for storing active nodes.
 
file  NodeHeap.h [code]
 Define the class NodeHeap for storing active nodes of the branch-and-bound tree on a heap.
 
file  NodeIncRelaxer.cpp
 Define the class NodeIncRelaxer.
 
file  NodeIncRelaxer.h [code]
 Declare the NodeIncRelaxer class. It creates relaxation by only incrementing changes made in ancestor nodes.
 
file  NodeProcessor.cpp
 Define two functions of NodeProcessor class.
 
file  NodeProcessor.h [code]
 Define the NodeProcessor class for processing nodes in the branch-and-bound algorithm.
 
file  NodeRelaxer.h [code]
 Define the NodeRelaxer class for creating relaxation for nodes in the branch-and-bound algorithm.
 
file  NodeStack.cpp
 Implement the class NodeStack for storing active nodes of the branch-and-bound tree on a stack data structure.
 
file  NodeStack.h [code]
 Define the class NodeStack for storing active nodes of the branch-and-bound tree on a stack data structure.
 
file  NonlinearFunction.cpp
 Define some basic functions for abstract base class NonlinearFunction.
 
file  NonlinearFunction.h [code]
 Declare abstract base class NonlinearFunction.
 
file  OAHandler.cpp
 
file  OAHandler.h [code]
 
file  Objective.cpp
 Define the Objective class for storing and manipulating objective function.
 
file  Objective.h [code]
 Declare the Objective class for storing and manipulating objective function.
 
file  OpCode.h [code]
 Declare the OpCodes used in Minotaur.
 
file  Operations.cpp
 Define some commonly used functions.
 
file  Operations.h [code]
 Declare some commonly used functions.
 
file  Option.h [code]
 Declare the Option class for managing options for Minotaur.
 
file  ParBndProcessor.cpp
 Implement simple node-processor for parallel branch-and-bound.
 
file  ParBndProcessor.h [code]
 Define simple node-processor for parallel branch-and-bound.
 
file  ParBranchAndBound.cpp
 Define ParBranchAndBound class for a generic parallel branch-and-bound method.
 
file  ParBranchAndBound.h [code]
 Declare the default branch-and-bound-algorithm.
 
file  ParCutMan.cpp
 Implement the methods of ParCutMan class.
 
file  ParCutMan.h [code]
 Manages storage, addition and deletion of cuts to problem.
 
file  ParMINLPDiving.cpp
 Define the ParMINLPDiving class for diving heuristics for MINLPs. This is a parallel extension of MINLPDiving heuristic in MINOTAUR.
 
file  ParMINLPDiving.h [code]
 Define the class ParMINLPDiving derived from base class Heuristics. This is a parallel extension of MINLPDiving heuristic in MINOTAUR.
 
file  ParNodeIncRelaxer.cpp
 Define the class ParNodeIncRelaxer.
 
file  ParNodeIncRelaxer.h [code]
 Declare the ParNodeIncRelaxer class. It creates relaxation by only incrementing changes made in ancestor nodes. All modifications to be applied while creating the relaxation are fist translated appropriately.
 
file  ParPCBProcessor.cpp
 Define the derived class of NodeProcessor that solves LP or NLP relaxations for parallel algorithms.
 
file  ParPCBProcessor.h [code]
 Define the derived class of NodeProcessor that solves LP relaxations.
 
file  ParQGBranchAndBound.cpp
 Define ParQGBranchAndBound class for a generic parallel branch-and-bound method.
 
file  ParQGBranchAndBound.h [code]
 Declare the default branch-and-bound-algorithm.
 
file  ParQGHandler.cpp
 
file  ParQGHandler.h [code]
 
file  ParQGHandlerAdvance.cpp
 
file  ParQGHandlerAdvance.h [code]
 
file  ParReliabilityBrancher.cpp
 Define methods for reliability branching in a parallel framework.
 
file  ParReliabilityBrancher.h [code]
 
file  ParTreeManager.cpp
 Define class ParTreeManager for managing tree for parallel Branch-and-Bound.
 
file  ParTreeManager.h [code]
 
file  PCBProcessor.cpp
 Define the derived class of NodeProcessor that solves LP or NLP relaxations.
 
file  PCBProcessor.h [code]
 Define the derived class of NodeProcessor that solves LP or NLP relaxations.
 
file  PerspCon.cpp
 Define base class for finding constraints amenable to perspective reformulation (PR) in the given problem. \Author Meenarli Sharma, Indian Institute of Technology Bombay.
 
file  PerspCon.h [code]
 Declare a base class PerspCon for identifying structures amenable to perspective reformulation (PR) (mention the paper)
 
file  PerspCutGenerator.cpp
 Declare PerspCutGenerator class.
 
file  PerspCutGenerator.h [code]
 
file  PerspCutHandler.cpp
 Declare PerspCutHandler class to generate perspective cuts.
 
file  PerspCutHandler.h [code]
 Declare PerspCutHandler class for perspective reformulation (PR). It detects constraints amenable to perspective reformulation and generates perspective cuts whenever needed.
 
file  PerspList.cpp
 Define base class that determines perspective constraints..
 
file  PerspList.h [code]
 Declare base class PerspList.
 
file  PolynomialFunction.h [code]
 Define the PolynomialFunction class for handling polynomial constraints.
 
file  PreAuxVars.cpp
 Define the PreAuxVars class for saving additional variables variables added during presolve.
 
file  PreAuxVars.h [code]
 Declare the PreAuxVars class for saving additional variables variables added during presolve.
 
file  PreDelVars.cpp
 Postsolver for substituted variables.
 
file  PreDelVars.h [code]
 Declare the PreDelVars class for saving and restoring variables in presolve.
 
file  PreMod.h [code]
 Declare the PreMod class for saving changes in presolve.
 
file  Presolver.cpp
 Define Presolver class for presolving.
 
file  Presolver.h [code]
 Declare Presolver class for presolving.
 
file  PreSubstVars.cpp
 Postsolver for substituted variables.
 
file  PreSubstVars.h [code]
 Declare the PreSubstVars class for saving and restoring variables substituted during presolve.
 
file  Problem.cpp
 Define base class Problem.
 
file  Problem.h [code]
 Declare the base class Modification.
 
file  ProblemSize.h [code]
 Declare structure ProblemSize for storing statistics about the problem.
 
file  ProbStructure.cpp
 Define base class for Problem structure.
 
file  ProbStructure.h [code]
 Declare base class ProbStructure.
 
file  QGAdvHandler.cpp
 
file  QGAdvHandler.h [code]
 
file  QGHandler.cpp
 
file  QGHandler.h [code]
 
file  QGHandler.MotivationStats.h [code]
 
file  QGHandlerAdvance.cpp
 
file  QGHandlerAdvance.h [code]
 
file  QPDProcessor.cpp
 Define base class QPDProcessor.
 
file  QPDProcessor.h [code]
 Define the derived class of QPDProcessor that solves QPs and NLP relaxations.
 
file  QPEngine.h [code]
 
file  QuadHandler.cpp
 Implement a handler for simple quadratic constraints of the form $ y = x_1x_2 $, and $ y = x_1^2 $,.
 
file  QuadHandler.h [code]
 Declare a handler for simple quadratic constraints of the form $ y_1 = x_1x_2 $, and $ y_1 = x_1^2 $, It does not handle any other quadratic constraints.
 
file  QuadraticFunction.cpp
 Define class QuadraticFunction for storing quadratic functions.
 
file  QuadraticFunction.h [code]
 Construct and manage quadratic functions.
 
file  QuadTransformer.cpp
 Define class for reformulations a quadratic problem to make it suitable for handlers.
 
file  QuadTransformer.h [code]
 Declare class for transformation of quadraic problem.
 
file  RandomBrancher.cpp
 Define methods for Random branching.
 
file  RandomBrancher.h [code]
 Declare methods and data structures for Random branching.
 
file  RCHandler.cpp
 
file  RCHandler.h [code]
 Used for tightening lower and upper bound of variables using reduced costs.
 
file  Reader.cpp
 Define Reader class for reading MPS files.
 
file  Reader.h [code]
 Reader for MPS files.
 
file  Relaxation.cpp
 Define base class Relaxation.
 
file  Relaxation.h [code]
 Declare the class Relaxation for storing and manipulating relaxations.
 
file  ReliabilityBrancher.cpp
 Define methods for reliability branching.
 
file  ReliabilityBrancher.h [code]
 Declare methods and data structures for reliability branching.
 
file  SamplingHeur.cpp
 Define the SamplingHeur class for diving heuristics for MINLPs.
 
file  SamplingHeur.h [code]
 Define the class SamplingHeur derived from base class Heuristics.
 
file  SecantMod.h [code]
 
file  SimpleCutMan.cpp
 Implement the methods of SimpleCutMan class.
 
file  SimpleCutMan.h [code]
 Very simple implementation of a cut manager.
 
file  SimpleTransformer.cpp
 Define class for simple reformulations a problem to make it suitable for handlers.
 
file  SimpleTransformer.h [code]
 Declare class for simple transformation of problem.
 
file  SimplexQuadCutGen.h [code]
 Define class for generating cuts for quadratic constraints from the simplex tableau.
 
file  Solution.h [code]
 Implement base class Solution.
 
file  SolutionPool.cpp
 Define SolutionPool class for a storing solutions.
 
file  SolutionPool.h [code]
 Declare a container for storing solutions and their qualities.
 
file  SOS.cpp
 SOS class stores data regarding SOS1 and SOS2 constraints.
 
file  SOS.h [code]
 Declare data structures for an SOS-I and SOS-II constraint.
 
file  SOS1Handler.cpp
 Declare the SOS1Handler class for handling SOS type I constraints. It checks integrality and provides branching candidates. Does not do any presolving and cut-generation.
 
file  SOS1Handler.h [code]
 Declare the SOS1Handler class for handling SOS type I constraints. It checks integrality and provides branching candidates. Does not do any presolving and cut-generation.
 
file  SOS2Handler.cpp
 Declare the SOS2Handler class for handling SOS type II constraints. It checks integrality and provides branching candidates. Does not do any presolving and cut-generation.
 
file  SOS2Handler.h [code]
 Declare the SOS2Handler class for handling SOS type II constraints. It checks integrality and provides branching candidates. Does not do any presolving and cut-generation.
 
file  SOSBrCand.cpp
 Define methods for SOS branching candidates (both Type 1 and 2).
 
file  SOSBrCand.h [code]
 Declare the classes SOSBrCand for storing candidates for branching based upon SOS constraints.
 
file  SppHeur.cpp
 Define the SppHeur class for heuristics for set partitioning.
 
file  SppHeur.h [code]
 Define the class SppHeur for finding solutions to set partitioning.
 
file  STOAHandler.cpp
 
file  STOAHandler.h [code]
 
file  Timer.h [code]
 Define the TimerFactory and varios Timer classes.
 
file  Transformer.cpp
 Define class for reformulating a problem suitable for handlers.
 
file  Transformer.h [code]
 Declare base class for transforming problems.
 
file  TransPoly.cpp
 Define class for reformulating a polynomial problem.
 
file  TransPoly.h [code]
 Declare class for reformulating a polynomial problem.
 
file  TransSep.cpp
 Declare TransSep class for detecting nonlinear function separability. It checks whether the given nonlinear objective and constraint functions are separable. If separable, then it reformulates the original problem.
 
file  TransSep.h [code]
 Declare TransSep class for detecting separable nonlinear constraints in the problem. It considers nonlinear constraints of a problem and checks whether they are separable. If a nonlinear constraint is separable, then it reformulates original problem by introducing extra variables. Original nonlinear constraint becomes linear and each separable part constitutes a nonlinear constraint. This class also gives computational graphs of nonlinear constraints corresponding separable parts of separable constraints. \Author Meenarli Sharma, Indian Institute of Technology Bombay.
 
file  TreeManager.cpp
 Define class TreeManager for managing tree for Branch-and-Bound.
 
file  TreeManager.h [code]
 Declare class ParTreeManager for managing tree for parallel Branch-and-Bound.
 
file  Types.cpp
 Define methods specific to Types.h (like compare functions for sorting etc.)
 
file  Types.h [code]
 Declare important 'types' used in Minotaur.
 
file  UnambRelBrancher.cpp
 Define methods for unambiguous reliability branching.
 
file  UnambRelBrancher.h [code]
 Declare methods and data structures for unambiguous reliability branching.
 
file  UnivarQuadHandler.h [code]
 Declare a handler for quadratic constraints of the form $ y = ax^2 + bx $, $ y = (x_1+x_2)^2 $, and $ y = (x_1-x_2)^2 $, It does not handle any other quadratic constraints.
 
file  VarBoundMod.cpp
 Implement the Modification class VarBoundMod, that is used to store modifications to a bound on a variable.
 
file  VarBoundMod.h [code]
 Declare the class VarBoundMod. It is used to save modifications in a bound of a variable. Also declare VarBoundMod2 that is used to change both bounds of a variable.
 
file  Variable.cpp
 Define Variables class for storing variables of a problem.
 
file  Variable.h [code]
 Define the Variable class.
 
file  WarmStart.h [code]
 
file  WeakBrancher.cpp
 Define methods for Weak branching.
 
file  WeakBrancher.h [code]
 Declare methods and data structures for weak branching.
 
file  YEqBivar.cpp
 Define class for storing auxiliary variables equivalent to a bivar.
 
file  YEqBivar.h [code]
 Declare class for storing auxiliary variables equivalent to a bivar.
 
file  YEqCGs.cpp
 Define class for storing auxiliary variables for nonlinear functions that are expressed as computational graphs.
 
file  YEqCGs.h [code]
 Declare the class for storing auxiliary variables for nonlinear functions that are expressed as computational graphs.
 
file  YEqLFs.h [code]
 Declare the class for storing auxiliary variables for linear functions.
 
file  YEqMonomial.cpp
 Define class for storing auxiliary variables for monomial expressions.
 
file  YEqMonomial.h [code]
 Declare class for storing auxiliary variables for monomial expressions.
 
file  YEqQfBil.cpp
 Define class for storing auxiliary variables equivalebt to a product of two variables.
 
file  YEqQfBil.h [code]
 Declare class for storing auxiliary variables equivalent to a product of two variables.
 
file  YEqUCGs.cpp
 Define class for storing auxiliary variables for univariate nonlinear functions that are expressed as computational graphs.
 
file  YEqUCGs.h [code]
 Declare the class for storing auxiliary variables for univariate nonlinear functions that are expressed as computational graphs.
 
file  YEqUnivar.cpp
 Define class for storing auxiliary variables equivalent to a bivar.
 
file  YEqUnivar.h [code]
 Declare class for storing auxiliary variables equivalent to a univar.
 
file  YEqVars.cpp
 Define class for storing auxiliary variables equivalent to a sum of a variable and a constant.
 
file  YEqVars.h [code]
 Declare class for storing auxiliary variables equivalent to a sum of a variable and a constant.
 

Minotaur source code documented by Doxygen 1.9.4 on Thu Apr 24 2025