Combinatorial Optimization with Rational Objective Functions
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Tow algorithms for finding a minimal ratio hamiltonian cycle in a network
- Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications
- Computing the throughput of concatenation state machines
- The quickest flow problem
- Solving utility-maximization selection problems with multinomial logit demand: is the first-choice model a good approximation?
- Greedy-like algorithms for dynamic assortment planning under multinomial logit preferences
- Quadratic programming and combinatorial minimum weight product problems
- Risk models for the prize collecting Steiner tree problems with interval data
- A Mixed-Integer Fractional Optimization Approach to Best Subset Selection
- Cyclic flowshop scheduling with operators and robots: Vyacheslav Tanaev's vision and lasting contributions
- A generalized approximation framework for fractional network flow and packing problems
- Fuzzy random bottleneck spanning tree problems using possibility and necessity measures
- The inverse-parametric knapsack problem
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- Discrete Newton methods for the evacuation problem
- The cost-to-time ratio problem for large or infinite graphs
- Faster algorithms for next breakpoint and max value for parametric global minimum cuts
- Submodular function minimization
- Identification and validation of quasispecies models for biological systems
- Better-than-2 approximations for weighted tree augmentation and applications to Steiner tree
- Decomposable multi-parameter matroid optimization problems.
- Approximation algorithm for minimizing total latency in machine scheduling with deliveries
- The subdivision-constrained minimum spanning tree problem
- Chromatic k-nearest neighbor queries
- Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches
- A linear-time algorithm for solving continuous maximin knapsack problems
- A new contraction technique with applications to congruency-constrained cuts
- A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm
- Locating service centers with precedence constraints
- Multicommodity flows over time: Efficient algorithms and complexity
- Real time scheduling with a budget: parametric-search is better than binary search
- Strongly polynomial-time approximation for a class of bicriteria problems.
- Minimum cost-reliability ratio path problem
- The multi-weighted spanning tree problem
- Min-max controllable risk problems
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
- Budget-constrained minimum cost flows
- Extending NC and RNC algorithms
- Fractional programming
- Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
- Two scheduling problems with fuzzy due-dates
- Approximating points by a piecewise linear function
- The stable fixtures problem with payments
- Improved algorithms for optimal k sink location on path networks
- Fractional 0-1 programming: applications and algorithms
- The densest subgraph problem with a convex/concave size function
- One machine scheduling problem with fuzzy duedates
- An efficient, strongly polynomial, -approximation parametric optimization scheme
- Solving a class of feature selection problems via fractional 0--1 programming
- Complexity analysis for maximum flow problems with arc reversals
- Center location problems on tree graphs with subtree-shaped customers
- Parametric optimization of sequence alignment
- The economic lot-sizing problem with an emission capacity constraint
- Continuous bottleneck tree partitioning problems
- Faster distance-based representative skyline and \(k\)-center along Pareto front in the plane
- C-programming and the minimization of pseudolinear and additive concave functions
- Duality for balanced submodular flows
- Fast algorithms for diameter-optimally augmenting paths and trees
- Dynamic assortment personalization in high dimensions
- Reputation games for undirected graphs
- Interdicting structured combinatorial optimization problems with {0,1}-objectives
- On some large-scale LP relaxations for the graph partitioning problem and their optimal solutions
- Differentially private and budget-limited bandit learning over matroids
- Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows
- Bottleneck capacity expansion problems with general budget constraints
- Minsum \(k\)-sink problem on path networks
- Linear and combinatorial sharing problems
- On the complexity and approximability of budget-constrained minimum cost flows
- Continuous dynamic contraflow approach for evacuation planning
- Approximation algorithms for maximum latency and partial cycle cover
- A strongly polynomial algorithm for line search in submodular polyhedra
- Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games
- AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints
- The stable fixtures problem with payments
- Minimizing maximum risk for fair network connection with interval data
- Optimal building evacuation time considering evacuation routes
- Ratio combinatorial programs
- Approximation algorithms for combinatorial fractional programming problems
- Bibliography in fractional programming
- Integrality in the multinetwork min‐cost equal‐flow problem
- Efficient contraflow algorithms for quickest evacuation planning
- L-infinity interdistance selection by parametric search
- Computing the least quartile difference estimator in the plane
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis
- Optimization with additional variables and constraints
- Negative circuits for flows and submodular flows
- A critical survey on the network optimization algorithms for evacuation planning problems
- Single machine scheduling with controllable release and processing parameters
- The single most vital arc in the most economical path problem -- a parametric analysis
- Computing optimal scalings by parametric network algorithms
- An algorithm for fractional assignment problems
- Fractional 0-1 programming and submodularity
- The general facility location problem with connectivity on trees
- Hybrid column generation for large-size covering integer programs: application to transportation planning
- The constrained minimum weighted sum of job completion times problem
- A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
- Parametric problems on graphs of bounded tree-width
- Efficient algorithms for center problems in cactus networks
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)
