cppmain.cpp
Go to the documentation of this file.
30 * This is an example of using SCIP to solve the TSP problem on undirected graphs. See the doxygen documentation for an
34 /*--+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
SCIP_RETCODE SCIPincludeObjEventhdlr(SCIP *scip, scip::ObjEventhdlr *objeventhdlr, SCIP_Bool deleteobject)
Definition: objeventhdlr.cpp:221
Definition: struct_scip.h:68
2-Optimum - combinatorial improvement heuristic for TSP
Definition: HeurFarthestInsert.h:41
farthest insert - combinatorial heuristic for TSP
SCIP_RETCODE SCIPincludeObjHeur(SCIP *scip, scip::ObjHeur *objheur, SCIP_Bool deleteobject)
Definition: objheur.cpp:204
C++ wrapper for default SCIP plugins.
SCIP_RETCODE SCIPincludeObjConshdlr(SCIP *scip, scip::ObjConshdlr *objconshdlr, SCIP_Bool deleteobject)
Definition: objconshdlr.cpp:630
Definition: pqueue.h:37
C++ wrapper classes for SCIP.
Definition: type_retcode.h:42
event handler for new solutions in TSP
Definition: ReaderTSP.h:54
SCIP_RETCODE SCIPincludeDefaultPlugins(SCIP *scip)
Definition: scipdefplugins.c:37
C++ constraint handler for TSP subtour elimination constraints.
Definition: EventhdlrNewSol.h:41
SCIP_RETCODE SCIPincludeObjReader(SCIP *scip, scip::ObjReader *objreader, SCIP_Bool deleteobject)
Definition: objreader.cpp:155
SCIP_RETCODE SCIPprocessShellArguments(SCIP *scip, int argc, char **argv, const char *defaultsetname)
Definition: scipshell.c:243
fractional travelling salesman heuristic - Rounding heuristic for TSP
Definition: HeurFrats.h:43
Definition: ConshdlrSubtour.h:42
C++ file reader for TSP data files.
Definition: Heur2opt.h:41
Definition: ConshdlrSubtour.h:38
Definition: objbenders.h:43