The following pages link to Bicriteria Transportation Problem (Q3885513):
Displaying 50 items.
- Distributed localized bi-objective search (Q297390) (← links)
- The \(L\)-shape search method for triobjective integer programming (Q298165) (← links)
- A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem (Q319360) (← links)
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems (Q319373) (← links)
- Heuristic approaches for biobjective mixed 0-1 integer linear programming problems (Q319659) (← links)
- Choquet optimal set in biobjective combinatorial optimization (Q336494) (← links)
- An exact algorithm for biobjective mixed integer linear programming problems (Q342401) (← links)
- An interactive approach for bi-attribute multi-item auctions (Q342785) (← links)
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem (Q360382) (← links)
- Improving the anytime behavior of two-phase local search (Q408982) (← links)
- A new method for solving linear multi-objective transportation problems with fuzzy parameters (Q437915) (← links)
- Genetic algorithm based fuzzy stochastic transportation programming problem with continuous random variables (Q522436) (← links)
- Pyramidal tours and multiple objectives (Q604948) (← links)
- Structure and weak sharp minimum of the Pareto solution set for piecewise linear multiobjective optimization (Q607890) (← links)
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems (Q632658) (← links)
- An interactive algorithm for multi-objective route planning (Q639934) (← links)
- The Pareto-optimal solution set of the equilibrium network design problem with multiple commensurate objectives (Q651306) (← links)
- The biobjective undirected two-commodity minimum cost flow problem (Q707093) (← links)
- An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem (Q785628) (← links)
- On trade-off solution pairs in a special type of transportation problem (Q792881) (← links)
- A hybrid meta heuristic algorithm for bi-objective minimum cost flow (BMCF) problem (Q833641) (← links)
- Multiple objective minimum cost flow problems: a review (Q853016) (← links)
- Lower bound sets for biobjective shortest path problems (Q905755) (← links)
- Two-phase Pareto local search for the biobjective traveling salesman problem (Q972646) (← links)
- Bi-criteria single machine scheduling problem with a learning effect: Aneja-Nair method to obtain the set of optimal sequences (Q980085) (← links)
- Speed-up techniques for solving large-scale biobjective TSP (Q1038291) (← links)
- The maximum covering/shortest path problem: A multiobjective network design and routing formulation (Q1060958) (← links)
- On efficient sets in vector maximum problems - A brief survey (Q1068004) (← links)
- On a class of quadratic programs (Q1080777) (← links)
- Interactive solutions for the linear multiobjective transportation problem (Q1091276) (← links)
- Minmax combinatorial optimization (Q1130081) (← links)
- Bicriteria linear fractional programming (Q1148820) (← links)
- An algorithm for bicriterion linear programming (Q1163481) (← links)
- Efficiency and time-cost-tradeoffs in transportation problems (Q1169400) (← links)
- Bicriteria network flow problems: Continuous case (Q1175771) (← links)
- Some clarifications on the bicriteria scheduling of unit execution time jobs on a single machine (Q1184462) (← links)
- A note on solving bicriteria linear programming problems using single criteria software (Q1186007) (← links)
- The convergence rate of the sandwich algorithm for approximating convex functions (Q1195962) (← links)
- A bicriterion framework for operations assignment and routing flexibility analysis in cellular manufacturing systems (Q1198309) (← links)
- Efficient solutions for the bicriteria network flow problem (Q1202272) (← links)
- Bicriteria network flow problems: Integer case (Q1207067) (← links)
- Fuzzy bicriteria multi-index transportation problems for coal allocation planning of Taipower (Q1278364) (← links)
- A method for convex curve approximation (Q1278603) (← links)
- A variation of the assignment problem (Q1309926) (← links)
- Fuzzy programming approach to multicriteria decision making transportation problem (Q1311779) (← links)
- Fuzzy programming approach to multiobjective solid transportation problem (Q1313057) (← links)
- Optimization over the efficient set: Four special cases (Q1321439) (← links)
- Constructing the set of efficient objective values in linear multiple objective transportation problems (Q1328608) (← links)
- An algorithm for the committee construction problem (Q1333475) (← links)
- On bicriterion minimal spanning trees: An approximation (Q1360130) (← links)
