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.

• Inverse feasibility problems of the inverse maximum flow problems (Q261056) (← links)
• Inverse eccentric vertex problem on networks (Q301951) (← links)
• Algorithms for the partial inverse matroid problem in which weights can only be increased (Q312484) (← links)
• Capacity inverse minimum cost flow problems under the weighted Hamming distance (Q315493) (← links)
• The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance (Q320084) (← links)
• The inverse parallel machine scheduling problem with minimum total completion time (Q380601) (← links)
• A bilevel programming problem with maximization of a supermodular function in the lower level (Q385481) (← links)
• Some inverse optimization problems on network (Q394471) (← links)
• Optimality conditions for a bilevel matroid problem (Q411248) (← links)
• An inverse approach to convex ordered median problems in trees (Q421273) (← links)
• Notes on inverse bin-packing problems (Q458387) (← links)
• The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones (Q458938) (← links)
• Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm (Q486731) (← links)
• Outlier respecting points approximation (Q517798) (← links)
• Inverse \(p\)-median problems with variable edge lengths (Q532535) (← links)
• Inverse problems and solution methods for a class of nonlinear complementarity problems (Q540647) (← links)
• A perturbation approach for an inverse quadratic programming problem (Q607673) (← links)
• Inverse scheduling: Two-machine flow-shop problem (Q640308) (← links)
• Heuristic algorithms for the inverse mixed integer linear programming problem (Q652705) (← links)
• Data-driven inverse optimization with imperfect information (Q681497) (← links)
• Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector (Q723499) (← links)
• Inverse integer programming (Q732771) (← links)
• Inverse center location problem on a tree (Q732826) (← links)
• Data-driven estimation in equilibrium using inverse optimization (Q747777) (← links)
• The inverse connected \(p\)-median problem on block graphs under various cost functions (Q827099) (← links)
• Inverse conic linear programs in Banach spaces (Q828644) (← links)
• A characterization of optimal multiprocessor schedules and new dominance rules (Q830925) (← links)
• Partial inverse min-max spanning tree problem (Q830941) (← links)
• Inverse minimum flow problem (Q874337) (← links)
• Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm (Q883285) (← links)
• Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems (Q885822) (← links)
• Inverse min-max spanning tree problem under the weighted sum-type Hamming distance (Q924129) (← links)
• The inverse 1-maxian problem with edge length modification (Q941835) (← links)
• The inverse 1-median problem on a cycle (Q951097) (← links)
• A smoothing Newton method for a type of inverse semi-definite quadratic programming problem (Q953410) (← links)
• The 0-1 inverse maximum stable set problem (Q955316) (← links)
• The inverse Fermat-Weber problem (Q976390) (← links)
• An augmented Lagrangian method for a class of Inverse quadratic programming problems (Q989969) (← links)
• Inverse minimum cost flow problems under the weighted Hamming distance (Q992575) (← links)
• Cutting plane algorithms for the inverse mixed integer linear programming problem (Q1015310) (← links)
• Up- and downgrading the 1-center in a network (Q1026756) (← links)
• Constrained inverse min-max spanning tree problems under the weighted Hamming distance (Q1029667) (← links)
• Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance (Q1034103) (← links)
• Inverse scheduling with maximum lateness objective (Q1041341) (← links)
• Inverse optimization for linearly constrained convex separable programming problems (Q1044084) (← links)
• Inverse 1-center location problems with edge length augmentation on trees (Q1044223) (← links)
• Solution structure of some inverse combinatorial optimization problems (Q1304391) (← links)
• Inverse optimization in high-speed networks (Q1399112) (← links)
• Inverse problems of submodular functions on digraphs (Q1573989) (← links)
• A general model of some inverse combinatorial optimization problems and its solution method under \(\ell_\infty\) norm (Q1598883) (← links)