Combinatorial Optimization with Rational Objective Functions
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A strongly polynomial simplex method for the linear fractional assignment problem
- Center location problems on tree graphs with subtree-shaped customers
- The subdivision-constrained minimum spanning tree problem
- Optimal building evacuation time considering evacuation routes
- Approximation algorithms for maximum latency and partial cycle cover
- Computing and minimizing the relative regret in combinatorial optimization with interval data
- Computing the least quartile difference estimator in the plane
- An algorithm for finding a matroid basis which maximizes the product of the weights of the elements
- The shortest path problem with two objective functions
- Linear and combinatorial sharing problems
- The cost-to-time ratio problem for large or infinite graphs
- Minimum cost-reliability ratio path problem
- L-infinity interdistance selection by parametric search
- Ratio combinatorial programs
- On the solution of discrete bottleneck problems
- On search over rationals
- Improved complexity bounds for location problems on the real line
- A fully polynomial time approximation scheme for minimum cost-reliability ratio problems
- Scheduling on a hypercube
- Negative circuits for flows and submodular flows
- A combinatorial interior point method for network flow problems
- Two scheduling problems with fuzzy due-dates
- Extending NC and RNC algorithms
- Calculation of stability radii for combinatorial optimization problems
- Locating service centers with precedence constraints
- The single most vital arc in the most economical path problem -- a parametric analysis
- Computing maximum mean cuts
- Parametric optimization of sequence alignment
- The most critical path in a PERT network: A heuristic approach
- One machine scheduling problem with fuzzy duedates
- Optimal and approximate bottleneck Steiner trees
- The inverse-parametric knapsack problem
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
- Decomposable multi-parameter matroid optimization problems.
- Fuzzy random bottleneck spanning tree problems using possibility and necessity measures
- Weight reduction problems with certain bottleneck objectives.
- Minmax regret solutions for minimax optimization problems with uncertainty
- New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization
- Efficient contraflow algorithms for quickest evacuation planning
- The stable fixtures problem with payments
- Revisiting k-sum optimization
- Fractional 0-1 programming: applications and algorithms
- Operations research applications of dichotomous search
- Optimizing healthcare network design under reference pricing and parameter uncertainty
- On the tightness of an LP relaxation for rational optimization and its applications
- Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications
- An algorithm for source location in directed graphs
- Optimization with additional variables and constraints
- Conical partition algorithm for maximizing the sum of dc ratios
- The densest subgraph problem with a convex/concave size function
- Two machine mixed shop scheduling problem with controllable machine speeds
- A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
- Continuous bottleneck tree partitioning problems
- An algorithm for fractional assignment problems
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
- Approximation algorithms for fractional knapsack problems
- On some large-scale LP relaxations for the graph partitioning problem and their optimal solutions
- \(\varepsilon\)-approximation minimization of convex functions in fixed dimension
- Min-max controllable risk problems
- Fractional 0-1 programming and submodularity
- Min max min robust (relative) regret combinatorial optimization
- Solving a class of feature selection problems via fractional 0--1 programming
- Minimizing maximum risk for fair network connection with interval data
- A linear-time algorithm for solving continuous maximin knapsack problems
- Minsum \(k\)-sink problem on path networks
- An FPTAS for the knapsack problem with parametric weights
- Discrete Newton methods for the evacuation problem
- The maximum ratio clique problem
- On the complexity and approximability of budget-constrained minimum cost flows
- Efficient algorithms for center problems in cactus networks
- Multicommodity flows over time: Efficient algorithms and complexity
- Approximating points by a piecewise linear function
- Improved algorithms for some competitive location centroid problems on paths, trees and graphs
- Identification and validation of quasispecies models for biological systems
- A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
- Continuous dynamic contraflow approach for evacuation planning
- A general approximation method for bicriteria minimization problems
- A strongly polynomial algorithm for line search in submodular polyhedra
- On equilibria for ADM minimization games
- Single machine scheduling with controllable release and processing parameters
- Cyclic flowshop scheduling with operators and robots: Vyacheslav Tanaev's vision and lasting contributions
- A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm
- The constrained minimum weighted sum of job completion times problem
- A survey on models and algorithms for discrete evacuation planning network problems
- One-way and round-trip center location problems
- Reputation games for undirected graphs
- Approximating a class of combinatorial problems with rational objective function
- Bottleneck capacity expansion problems with general budget constraints
- A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
- Budget-constrained minimum cost flows
- The stable fixtures problem with payments
- An efficient, strongly polynomial, -approximation parametric optimization scheme
- An introduction to network flows over time
- Interdicting structured combinatorial optimization problems with {0,1}-objectives
- The economic lot-sizing problem with an emission capacity constraint
- AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints
- The general facility location problem with connectivity on trees
- Hybrid column generation for large-size covering integer programs: application to transportation planning
- Differentially private and budget-limited bandit learning over matroids
- Dynamic assortment personalization in high dimensions
This page was built for publication: Combinatorial Optimization with Rational Objective Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3861175)
