Pages that link to "Item:Q3812058"
From MaRDI portal
The following pages link to Finding the set of alternatives in discrete multicriterion problems (Q3812058):
Displaying 11 items.
- Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits (Q336534) (← links)
- Selecting a single result from an aggregate of contradictory alternatives with use of multiset theory (Q786100) (← links)
- Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem (Q852261) (← links)
- Interval-parameter optimization problems on graphs (Q1040365) (← links)
- On complete and quasi-complete two-criteria optimization problems on graphs (Q1795505) (← links)
- Completeness of vector discrete optimization problems (Q1905199) (← links)
- (Q3141333) (← links)
- A Survey on Multiple Objective Minimum Spanning Tree Problems (Q3637314) (← links)
- An algorithm for solving a class of discrete multicriterion problems (Q3710331) (← links)
- On Selecting a Subset Containing the Alternative with the Largest Priority (Q4320333) (← links)
- Multicriteria path and tree problems: discussion on exact algorithms and applications (Q4918252) (← links)