Pages that link to "Item:Q3861175"
From MaRDI portal
The following pages link to Combinatorial Optimization with Rational Objective Functions (Q3861175):
Displaying 50 items.
- Budget-constrained minimum cost flows (Q281825) (← links)
- An efficient, strongly polynomial, \(\varepsilon\)-approximation parametric optimization scheme (Q290269) (← links)
- The economic lot-sizing problem with an emission capacity constraint (Q299782) (← links)
- The general facility location problem with connectivity on trees (Q335115) (← links)
- Hybrid column generation for large-size covering integer programs: application to transportation planning (Q336412) (← links)
- Risk models for the prize collecting Steiner tree problems with interval data (Q403434) (← links)
- A branch-and-cut algorithm for the latent-class logit assortment problem (Q496669) (← links)
- Revisiting Karnik-Mendel algorithms in the framework of linear fractional programming (Q511623) (← links)
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle (Q543415) (← links)
- C-programming and the minimization of pseudolinear and additive concave functions (Q579142) (← links)
- Duality for balanced submodular flows (Q581206) (← links)
- Parametric search made practical (Q598230) (← links)
- A generalized approximation framework for fractional network flow and packing problems (Q684147) (← links)
- Strongly polynomial-time approximation for a class of bicriteria problems. (Q703276) (← links)
- Solving utility-maximization selection problems with multinomial logit demand: is the first-choice model a good approximation? (Q827131) (← links)
- A PTAS for capacitated sum-of-ratios optimization (Q833588) (← links)
- Real time scheduling with a budget: parametric-search is better than binary search (Q845717) (← links)
- Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization (Q847846) (← links)
- Partial multicuts in trees (Q861281) (← links)
- Approximation algorithm for minimizing total latency in machine scheduling with deliveries (Q924636) (← links)
- An inverse model for the most uniform problem (Q924880) (← links)
- Optimal paths in bi-attribute networks with fractional cost functions (Q928022) (← links)
- Computing the throughput of concatenation state machines (Q954952) (← links)
- Complexity analysis for maximum flow problems with arc reversals (Q965819) (← links)
- Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches (Q972328) (← links)
- Quadratic programming and combinatorial minimum weight product problems (Q985315) (← links)
- Submodular function minimization (Q995782) (← links)
- A strongly polynomial simplex method for the linear fractional assignment problem (Q1003483) (← links)
- Center location problems on tree graphs with subtree-shaped customers (Q1005232) (← links)
- The subdivision-constrained minimum spanning tree problem (Q1006063) (← links)
- Optimal building evacuation time considering evacuation routes (Q1011205) (← links)
- Approximation algorithms for maximum latency and partial cycle cover (Q1015324) (← links)
- Computing and minimizing the relative regret in combinatorial optimization with interval data (Q1019293) (← links)
- Computing the least quartile difference estimator in the plane (Q1020878) (← links)
- An algorithm for finding a matroid basis which maximizes the product of the weights of the elements (Q1068836) (← links)
- The shortest path problem with two objective functions (Q1077332) (← links)
- Linear and combinatorial sharing problems (Q1081535) (← links)
- The cost-to-time ratio problem for large or infinite graphs (Q1101357) (← links)
- Minimum cost-reliability ratio path problem (Q1102209) (← links)
- L-infinity interdistance selection by parametric search (Q1115620) (← links)
- Ratio combinatorial programs (Q1130080) (← links)
- On the solution of discrete bottleneck problems (Q1167061) (← links)
- On search over rationals (Q1170866) (← links)
- Improved complexity bounds for location problems on the real line (Q1180820) (← links)
- A fully polynomial time approximation scheme for minimum cost-reliability ratio problems (Q1183334) (← links)
- Scheduling on a hypercube (Q1183498) (← links)
- Negative circuits for flows and submodular flows (Q1192951) (← links)
- A combinatorial interior point method for network flow problems (Q1196185) (← links)
- Two scheduling problems with fuzzy due-dates (Q1198861) (← links)
- Extending NC and RNC algorithms (Q1263974) (← links)
