The following pages link to Joao Carlos Namorado Climaco (Q1166421):
Displaying 50 items.
- Multiobjective linear and integer programming (Q286529) (← links)
- Bicriteria path problem minimizing the cost and minimizing the number of labels (Q385462) (← links)
- (Q555938) (redirect page) (← links)
- On a bi-dimensional dynamic alternative routing method (Q555940) (← links)
- A scatter search method for the bi-criteria multi-dimensional \(\{0,1\}\)-knapsack problem using surrogate relaxation (Q702759) (← links)
- Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems (Q857299) (← links)
- Efficient primal-dual heuristic for a dynamic location problem (Q858286) (← links)
- A review of interactive methods for multiobjective integer and mixed-integer programming (Q869154) (← links)
- Internet packet routing: application of a \(K\)-quickest path algorithm (Q877587) (← links)
- (Q926598) (redirect page) (← links)
- Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm (Q926599) (← links)
- A dynamic location problem with maximum decreasing capacities (Q953304) (← links)
- A memetic algorithm for multi-objective dynamic location problems (Q960114) (← links)
- The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem (Q989830) (← links)
- Finding non-dominated bicriteria shortest pairs of disjoint simple paths (Q1025230) (← links)
- A mixed integer linear formulation for the minimum label spanning tree problem (Q1025265) (← links)
- A bicriterion shortest path algorithm (Q1166423) (← links)
- The generalized simplex method (Q1195877) (← links)
- Sensitivity analysis in MCDM using the weight space (Q1200790) (← links)
- A parallel implementation of the PROMETHEE method (Q1291682) (← links)
- Planning the evolution to broadband access networks: A multicriteria approach (Q1296687) (← links)
- An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions (Q1304515) (← links)
- A multiple criteria model for new telecommunication service planning (Q1319528) (← links)
- On the application of TRIMAP to problems with multiple decision makers (Q1339212) (← links)
- Conflicting criteria, cooperating processors - some experiments on implementing a multicriteria decision support method on a parallel computer (Q1370708) (← links)
- An interactive procedure dedicated to a bicriteria plant location model. (Q1413829) (← links)
- Solving bicriteria 0--1 knapsack problems using a labeling algorithm. (Q1413848) (← links)
- A note on a new variant of Murty's ranking assignments algorithm (Q1416101) (← links)
- A critical reflection on optimal decision. (Q1417552) (← links)
- A note on a decision support system for multiobjective integer and mixed-integer programming problems. (Q1428069) (← links)
- An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound (Q1577993) (← links)
- An aggregation/disaggregation approach to obtain robust conclusions with ELECTRE TRI (Q1600914) (← links)
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems (Q1806944) (← links)
- Resolving inconsistencies among constraints on the parameters of an MCDA model (Q1869532) (← links)
- An algorithm for ranking quickest simple paths (Q1886854) (← links)
- Dealing with imprecise information in group multicriteria decisions: a methodology and a GDSS architecture (Q1887887) (← links)
- Shortest path problems with partial information: Models and algorithms for detecting dominance (Q1969885) (← links)
- An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks (Q2146374) (← links)
- Interactive decision support for multiobjective transportation problems (Q2368297) (← links)
- A comprehensive survey on the quickest path problem (Q2379862) (← links)
- Stability analysis of efficient solutions in multiobjective integer programming: A case study in load management (Q2384596) (← links)
- A new multiobjective dynamic routing method for multiservice networks: modelling and performance (Q2468381) (← links)
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems (Q2468486) (← links)
- A meta-model for multiobjective routing in MPLS networks (Q2481754) (← links)
- Capacitated single allocation hub location problem-A bi-criteria approach (Q2483516) (← links)
- An interactive method for 0-1 multiobjective problems using simulated annealing and tabu search (Q2567890) (← links)
- A scatter search method for bi-criteria \(\{0,1\}\)-knapsack problems (Q2570142) (← links)
- On the bicriterion - minimal cost/minimal label - spanning tree problem (Q2655606) (← links)
- Additive aggregation with variable interdependent parameters: the VIP analysis software (Q3156647) (← links)
- Hierarchical multiobjective routing in Multiprotocol Label Switching networks with two service classes: a heuristic solution (Q3184581) (← links)
