BFC, a branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0-1 programs

Article Abstract:

A framework for solving some types of 0-1 multi-stage scheduling/planning problems under uncertainty is presented in the objective function coefficients and the right-hand-side. The solution offered for such scenario group at each stage took into account all scenarios but without subordinating to any of them.

Analysis, Stochastic programming

---

Adjustment of O-D trip matrices from observed volumes: an algorithmic approach based on conjugate directions

Article Abstract:

A new algorithmic alternative to the origin-destination (O-D) matrix adjustment problem from observed link volumes when it is formulated as a mathematical programming problem with a bilevel structure is presented.

Optimization theory, Mathematical programming, Matrix management

---

Reinforcement learning for long-run average cost

Article Abstract:

A simulation-based algorithm that solves Markov and semi-Markov decision problems (SMDPs) is presented. A framework of reinforcement learning (RL) in the context of long-run average cost SMDPs is described.

Similar abstracts:

• Abstracts: Enhancing an algorithm for set covering problems. A tree search algorithm for the crew scheduling problem. A heuristic for Euclidean and rectilinear Steiner problems
• Abstracts: A heuristic for finding embedded network structure in mathematical programmes. The concave cost supply problem
• Abstracts: An alternating-move price-setting duopoly model with stochastic costs. Retail price cycles and the presence of small firms
• Abstracts: Critical competencies in Virtual Service Webs. Marketing resources and firm performance among SMEs. Searching for competitive advantage in the black box
• Abstracts: Data mining with genetic algorithms on binary trees. Using genetic algorithm for dynamic and multiple criteria web-site optimizations

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.