Pages that link to "Item:Q1888171"

The following pages link to Inverse combinatorial optimization: a survey on problems, methods, and results (Q1888171):

Displaying 50 items.

• On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks (Q1616830) (← links)
• An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance (Q1670106) (← links)
• Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector (Q1685587) (← links)
• Variable-sized uncertainty and inverse problems in robust optimization (Q1694311) (← links)
• A branch-and-bound algorithm for instrumental variable quantile regression (Q1697970) (← links)
• Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines (Q1702729) (← links)
• Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm (Q1704922) (← links)
• On inverse linear programming problems under the bottleneck-type weighted Hamming distance (Q1707916) (← links)
• An improved genetic algorithm for single-machine inverse scheduling problem (Q1718215) (← links)
• Inverse quickest center location problem on a tree (Q1741512) (← links)
• The inverse optimal value problem (Q1769073) (← links)
• Weighted inverse minimum spanning tree problems under Hamming distance (Q1774530) (← links)
• Inverse conic programming with applications (Q1779714) (← links)
• A polyhedral characterization of the inverse-feasible region of a mixed-integer program (Q1785436) (← links)
• The complexity analysis of the inverse center location problem (Q1819202) (← links)
• 2-balanced flows and the inverse 1-median problem in the Chebyshev space (Q1926492) (← links)
• On inverse traveling salesman problems (Q1936660) (← links)
• Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem (Q1945502) (← links)
• Weighted inverse maximum perfect matching problems under the Hamming distance (Q1945512) (← links)
• Inverse semidefinite quadratic programming problem with \(l_1\) norm measure (Q1987439) (← links)
• Behavioral modeling in weight loss interventions (Q1991236) (← links)
• Inverse minimum flow problem under the weighted sum-type Hamming distance (Q2012059) (← links)
• Inverse multiobjective optimization: inferring decision criteria from data (Q2038913) (← links)
• Inverse integer optimization with multiple observations (Q2039063) (← links)
• Inverse optimization approach to the identification of electricity consumer models (Q2045617) (← links)
• Constrained inverse minimum flow problems under the weighted Hamming distance (Q2049978) (← links)
• Inverse single facility location problem on a tree with balancing on the distance of server to clients (Q2076390) (← links)
• General restricted inverse assignment problems under \(l_1\) and \(l_{\infty}\) norms (Q2082216) (← links)
• Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector (Q2089873) (← links)
• Inverse optimization problems with multiple weight functions (Q2112661) (← links)
• Inverse optimization in semi-infinite linear programs (Q2183204) (← links)
• Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm (Q2205945) (← links)
• Computation of inverse 1-center location problem on the weighted trapezoid graphs (Q2212218) (← links)
• Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance (Q2240118) (← links)
• The minmax regret inverse maximum weight problem (Q2243298) (← links)
• Inverse quadratic programming problem with \(l_1\) norm measure (Q2244221) (← links)
• Capacity inverse minimum cost flow problem (Q2268762) (← links)
• Achieving target equilibria in network routing games without knowing the latency functions (Q2278946) (← links)
• Inverse generalized minimum cost flow problem under the Hamming distances (Q2314066) (← links)
• Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms (Q2330101) (← links)
• On the adjustment problem for linear programs (Q2370336) (← links)
• Inverse maximum flow problems under the weighted Hamming distance (Q2385473) (← links)
• Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes (Q2385479) (← links)
• Improved approaches to the exact solution of the machine covering problem (Q2398644) (← links)
• Inverse optimization for multi-objective linear programming (Q2414110) (← links)
• On the structure of the inverse-feasible region of a linear program (Q2417071) (← links)
• Robust inverse optimization (Q2417162) (← links)
• A majorized penalty approach to inverse linear second order cone programming problems (Q2438414) (← links)
• Inverse multi-objective combinatorial optimization (Q2444572) (← links)
• The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments (Q2445845) (← links)