Connectedness of efficient solutions in multiple criteria combinatorial optimization

Article Abstract:

The topological connectedness of the set of efficient solutions to multiple criteria optimization problems defined using a linear programming formulation was investigated. Specifically, computational experiments were carried out to show an exemption to the connectedness of efficient solutions to the shortest path problem and to prove the non-connectedness of the spanning tree problem.

Operations Research, Research, Management science, Multiple criteria decision making, Case studies, Combinatorial optimization

---

The biobjective undirected two-commodity minimum cost flow problem

Article Abstract:

The simultaneous shipment of several commodities from the origin to a destination of a network leads to multi-commodity flow problems. The change of variable approach is proposed to solve the biobjective two-commodity cost flow problem.

Freight Transportation, Goods & services distribution, Spain, Transportation, Commodities, Shipment of goods, Mathematical programming

---

Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phase approach

Article Abstract:

K-best algorithms are constructed using a two-phase method and ranking algorithms to biobjective combinatorial max-ordering problems.

New Zealand, Methods, Algorithms, Algorithm, Combinatorial analysis, Ranking and selection (Statistics)

Similar abstracts:

• Abstracts: Dynamic parametric bounds on efficient outcomes in interactive multiple criteria decision making problems. Decision making with the AHP: why is the principal eigenvector necessary
• Abstracts: CO2 emissions trading planning in combined heat and power production via multi-period stochastic optimization
• Abstracts: One-dimensional machine location problems in a multi-product flowline with equidistant locations. The effect of material flow and workload on the performance of machine location heuristics
• Abstracts: Scheduling uncertain orders in the customer-subcontractor context. A fuzzy genetic algorithm for driver scheduling
• Abstracts: Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function. The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime

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