Pages that link to "Item:Q3861175"

The following pages link to Combinatorial Optimization with Rational Objective Functions (Q3861175):

Displaying 50 items.

• Calculation of stability radii for combinatorial optimization problems (Q1306464) (← links)
• Locating service centers with precedence constraints (Q1314338) (← links)
• The single most vital arc in the most economical path problem -- a parametric analysis (Q1317083) (← links)
• Computing maximum mean cuts (Q1329796) (← links)
• Parametric optimization of sequence alignment (Q1336962) (← links)
• The most critical path in a PERT network: A heuristic approach (Q1341990) (← links)
• One machine scheduling problem with fuzzy duedates (Q1342032) (← links)
• Optimal and approximate bottleneck Steiner trees (Q1362990) (← links)
• The inverse-parametric knapsack problem (Q1388831) (← links)
• Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q1391297) (← links)
• Decomposable multi-parameter matroid optimization problems. (Q1401298) (← links)
• Fuzzy random bottleneck spanning tree problems using possibility and necessity measures (Q1410325) (← links)
• Weight reduction problems with certain bottleneck objectives. (Q1417504) (← links)
• Minmax regret solutions for minimax optimization problems with uncertainty (Q1591541) (← links)
• New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization (Q1602710) (← links)
• Efficient contraflow algorithms for quickest evacuation planning (Q1623855) (← links)
• The stable fixtures problem with payments (Q1651275) (← links)
• Revisiting \(k\)-sum optimization (Q1675256) (← links)
• Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
• Operations research applications of dichotomous search (Q1681128) (← links)
• Optimizing healthcare network design under reference pricing and parameter uncertainty (Q1694841) (← links)
• On the tightness of an LP relaxation for rational optimization and its applications (Q1755822) (← links)
• Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications (Q1774529) (← links)
• An algorithm for source location in directed graphs (Q1779694) (← links)
• Optimization with additional variables and constraints (Q1779712) (← links)
• Conical partition algorithm for maximizing the sum of dc ratios (Q1781967) (← links)
• The densest subgraph problem with a convex/concave size function (Q1799206) (← links)
• Two machine mixed shop scheduling problem with controllable machine speeds (Q1821024) (← links)
• A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program (Q1821694) (← links)
• Continuous bottleneck tree partitioning problems (Q1827846) (← links)
• An algorithm for fractional assignment problems (Q1842662) (← links)
• A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems (Q1866008) (← links)
• Approximation algorithms for fractional knapsack problems (Q1866996) (← links)
• On some large-scale LP relaxations for the graph partitioning problem and their optimal solutions (Q1904713) (← links)
• \(\varepsilon\)-approximation minimization of convex functions in fixed dimension (Q1919184) (← links)
• Min-max controllable risk problems (Q2040608) (← links)
• Fractional 0-1 programming and submodularity (Q2162513) (← links)
• Min max min robust (relative) regret combinatorial optimization (Q2216185) (← links)
• Solving a class of feature selection problems via fractional 0--1 programming (Q2241181) (← links)
• Minimizing maximum risk for fair network connection with interval data (Q2267272) (← links)
• A linear-time algorithm for solving continuous maximin knapsack problems (Q2277359) (← links)
• Minsum \(k\)-sink problem on path networks (Q2285143) (← links)
• An FPTAS for the knapsack problem with parametric weights (Q2294221) (← links)
• Discrete Newton methods for the evacuation problem (Q2330131) (← links)
• The maximum ratio clique problem (Q2356159) (← links)
• On the complexity and approximability of budget-constrained minimum cost flows (Q2361495) (← links)
• Efficient algorithms for center problems in cactus networks (Q2371802) (← links)
• Multicommodity flows over time: Efficient algorithms and complexity (Q2373727) (← links)
• Approximating points by a piecewise linear function (Q2375945) (← links)
• Improved algorithms for some competitive location centroid problems on paths, trees and graphs (Q2375952) (← links)