Pages that link to "Item:Q5326806"
From MaRDI portal
The following pages link to A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems (Q5326806):
Displaying 5 items.
- On the computation of all supported efficient solutions in multi-objective integer network flow problems (Q1042100) (← links)
- A new idea to evaluate networking problem and MCGDM problem in parametric interval valued Pythagorean arena (Q2152978) (← links)
- Warm-start routines for solving augmented weighted Tchebycheff network programs in multiple-objective network programming (Q2892259) (← links)
- Finding integer efficient solutions for multiple objective network programming problems (Q3087624) (← links)
- (Q3330961) (← links)