Uses of Interface
org.ddolib.modeling.FastLowerBound
Packages that use FastLowerBound
Package
Description
This package contains defining the compilation type and the compilation input
This package implements the acs, astar and ddo models for the Aircraft Landing Problem (ALP).
This package implements the acs, astar and ddo models for the Bounded Knapsack Problem (BKS).
This package implements the acs, astar and ddo models for the Golomb Rule Problem (GRP).
This package implements the acs, astar and ddo models for the Knapsack Problem (KS).
This package implements the acs, astar and ddo models for the Longest Common Subsequence (LCS) Problem.
This package implements the acs, astar and ddo models for the Maximum 2-Satisfiability Problem (MAX2SAT) Problem.
This package implements the acs, astar and ddo models for the Maximum Cut Problem (MCP).
This package implements the acs, astar and ddo models for the Maximum Independent Set Problem (MISP).
The Multidimensional Knapsack Problem (MKP) is a generalization of the KP
to multiple capacity constraints: $n$ items and $m$ dimensions of the knapsack
are given, each dimension with capacity bound $(C_1,\ldots ,C_m)$.
This package implements the acs, astar and ddo models for the Minimum Sum Completion Time (MSCT).
This package implements the acs, astar and ddo models for the Single Vehicle Pick-up and Delivery Problem (PDP).
This package implements the acs, astar and ddo models for the Pigment Sequencing Problem (PSP).
This package implements the acs, astar and ddo models for the Single Machine with Inventory Constraint (SMIC).
This package implements the acs, astar and ddo models for the Single Row Facility Layout Problem (SRFLP).
This package implements the acs, astar and ddo models for the Talent Scheduling problem (talentSched).
This package implements the acs, astar and ddo models for the Traveling Salesman Problem (TSP).
This package implements the acs, astar and ddo models for the Traveling Salesman Problem with Time Window (TSPTW).
This package contains the interfaces and abstract classes that must be implemented as problem
specific classes to model a problem.It also contains default implementation.
-
Uses of FastLowerBound in org.ddolib.ddo.core.compilation
Fields in org.ddolib.ddo.core.compilation declared as FastLowerBoundModifier and TypeFieldDescriptionCompilationConfig.flbFast lower bound heuristic used to estimate the best achievable objective value from a given state. -
Uses of FastLowerBound in org.ddolib.examples.alp
Classes in org.ddolib.examples.alp that implement FastLowerBoundModifier and TypeClassDescriptionclassFast lower bound computation for the Aircraft Landing Problem (ALP). -
Uses of FastLowerBound in org.ddolib.examples.boundedknapsack
Classes in org.ddolib.examples.boundedknapsack that implement FastLowerBoundModifier and TypeClassDescriptionclassA fast lower bound implementation for theBKSProblem(Bounded Knapsack Problem). -
Uses of FastLowerBound in org.ddolib.examples.gruler
Classes in org.ddolib.examples.gruler that implement FastLowerBound -
Uses of FastLowerBound in org.ddolib.examples.knapsack
Classes in org.ddolib.examples.knapsack that implement FastLowerBoundModifier and TypeClassDescriptionclassFast lower bound heuristic for the Knapsack Problem (KS). -
Uses of FastLowerBound in org.ddolib.examples.lcs
Classes in org.ddolib.examples.lcs that implement FastLowerBoundModifier and TypeClassDescriptionclassImplementation of a fast lower bound heuristic for the Longest Common Subsequence (LCS) problem. -
Uses of FastLowerBound in org.ddolib.examples.max2sat
Classes in org.ddolib.examples.max2sat that implement FastLowerBoundModifier and TypeClassDescriptionclassImplementation of a fast lower bound heuristic for the Maximum 2-Satisfiability (MAX2SAT) problem. -
Uses of FastLowerBound in org.ddolib.examples.maximumcoverage
Classes in org.ddolib.examples.maximumcoverage that implement FastLowerBoundModifier and TypeClassDescriptionclassFast lower bound computation for the Maximum Coverage problem. -
Uses of FastLowerBound in org.ddolib.examples.mcp
Classes in org.ddolib.examples.mcp that implement FastLowerBoundModifier and TypeClassDescriptionclassImplementation of fast lower bound heuristic for the MCP. -
Uses of FastLowerBound in org.ddolib.examples.misp
Classes in org.ddolib.examples.misp that implement FastLowerBoundModifier and TypeClassDescriptionclassComputes a fast lower bound for the Maximum Independent Set Problem (MISP). -
Uses of FastLowerBound in org.ddolib.examples.mks
Classes in org.ddolib.examples.mks that implement FastLowerBoundModifier and TypeClassDescriptionclassProvides a fast lower bound estimation for Multi-dimensional Knapsack (MKS) states. -
Uses of FastLowerBound in org.ddolib.examples.msct
Classes in org.ddolib.examples.msct that implement FastLowerBoundModifier and TypeClassDescriptionclassProvides a fast lower bound computation for the Maximum Sum of Compatible Tasks (MSCT) problem. -
Uses of FastLowerBound in org.ddolib.examples.pdp
Classes in org.ddolib.examples.pdp that implement FastLowerBoundModifier and TypeClassDescriptionclassProvides a fast lower bound estimation for the Pickup and Delivery Problem (PDP). -
Uses of FastLowerBound in org.ddolib.examples.pigmentscheduling
Classes in org.ddolib.examples.pigmentscheduling that implement FastLowerBoundModifier and TypeClassDescriptionclassComputes a fast lower bound for the Pigment Sequencing Problem (PSP). -
Uses of FastLowerBound in org.ddolib.examples.smic
Classes in org.ddolib.examples.smic that implement FastLowerBoundModifier and TypeClassDescriptionclassTheSMICFastLowerBoundclass provides a fast and simple estimation of the lower bound of the remaining cost (or completion time) in the Single Machine with Inventory Constraint (SMIC) scheduling problem. -
Uses of FastLowerBound in org.ddolib.examples.srflp
Classes in org.ddolib.examples.srflp that implement FastLowerBoundModifier and TypeClassDescriptionclassProvides a fast lower-bound estimation for the Single-Row Facility Layout Problem (SRFLP) based on the current state of the solution. -
Uses of FastLowerBound in org.ddolib.examples.talentscheduling
Classes in org.ddolib.examples.talentscheduling that implement FastLowerBoundModifier and TypeClassDescriptionclassImplementation of a fast lower bound for the Talent Scheduling Problem (TSP). -
Uses of FastLowerBound in org.ddolib.examples.tsp
Classes in org.ddolib.examples.tsp that implement FastLowerBoundModifier and TypeClassDescriptionclassImplementation of a fast lower bound for the Traveling Salesman Problem (TSP). -
Uses of FastLowerBound in org.ddolib.examples.tsptw
Classes in org.ddolib.examples.tsptw that implement FastLowerBoundModifier and TypeClassDescriptionclassImplementation of a fast lower bound for the Traveling Salesman Problem with Time Windows (TSPTW). -
Uses of FastLowerBound in org.ddolib.modeling
Classes in org.ddolib.modeling that implement FastLowerBoundModifier and TypeClassDescriptionclassDefault implementation of theFastLowerBoundinterface that always returnsInteger.MIN_VALUEas the lower bound estimate.Methods in org.ddolib.modeling that return FastLowerBoundModifier and TypeMethodDescriptiondefault FastLowerBound<T> Model.lowerBound()Returns a heuristic that estimates a lower bound on the objective value for a given state.