Pages that link to "Item:Q2473296"
From MaRDI portal
The following pages link to Feasibility and infeasibility in optimization. Algorithms and computational methods. (Q2473296):
Displaying 50 items.
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization (Q298162) (← links)
- Dual averaging with adaptive random projection for solving evolving distributed optimization problems (Q306393) (← links)
- Achieving MILP feasibility quickly using general disjunctions (Q336442) (← links)
- An interactive approach for bi-attribute multi-item auctions (Q342785) (← links)
- Feasibility in reverse convex mixed-integer programming (Q439456) (← links)
- Preferential reducts and constructs in robust multiple criteria ranking and sorting (Q480786) (← links)
- Irreducible infeasible sets in convex mixed-integer programs (Q495724) (← links)
- A heuristic block coordinate descent approach for controlled tabular adjustment (Q547141) (← links)
- A multi-objective production smoothing model with compressible operating times (Q638895) (← links)
- A generalized projection-based scheme for solving convex constrained optimization problems (Q721952) (← links)
- A hybrid algorithm for solving linear inequalities in a least squares sense (Q1014358) (← links)
- Specialized fast algorithms for IQC feasibility and optimization problems. (Q1428693) (← links)
- A fast eigenvalue approach for solving the trust region subproblem with an additional linear inequality (Q1655381) (← links)
- Hybrid simulated annealing and MIP-based heuristics for stochastic lot-sizing and scheduling problem in capacitated multi-stage production system (Q1667804) (← links)
- Certificates of infeasibility via nonsmooth optimization (Q1675645) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Complexity of minimum irreducible infeasible subsystem covers for flow networks (Q1752598) (← links)
- Convergence and perturbation resilience of dynamic string-averaging projection methods (Q1938920) (← links)
- Budget-cut: introduction to a budget based cutting-plane algorithm for capacity expansion models (Q2136875) (← links)
- Block-sparse recovery of semidefinite systems and generalized null space conditions (Q2197151) (← links)
- Identifying relatively irreducible infeasible subsystems of linear inequalities (Q2241565) (← links)
- Automatic repair of convex optimization problems (Q2245690) (← links)
- Feasible partition problem in reverse convex and convex mixed-integer programming (Q2256208) (← links)
- Minimal infeasible constraint sets in convex integer programs (Q2268936) (← links)
- Proximal operator of quotient functions with application to a feasibility problem in query optimization (Q2345665) (← links)
- The inexact fixed matrix iteration for solving large linear inequalities in a least squares sense (Q2346285) (← links)
- Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods (Q2346394) (← links)
- Unit-operation nonlinear modeling for planning and scheduling applications (Q2358139) (← links)
- Improved constraint consensus methods for seeking feasibility in nonlinear programs (Q2377177) (← links)
- An algorithm for binary linear chance-constrained problems using IIS (Q2419523) (← links)
- Irreducible infeasible subsystems of semidefinite systems (Q2420811) (← links)
- Multistart algorithms for seeking feasibility (Q2459378) (← links)
- Infeasibility resolution based on goal programming (Q2459385) (← links)
- On linear infeasibility arising in intensity-modulated radiation therapy inverse planning (Q2472384) (← links)
- MCS Extraction with Sublinear Oracle Queries (Q2818026) (← links)
- Snapping Graph Drawings to the Grid Optimally (Q2961511) (← links)
- Consistency Analysis for Massively Inconsistent Datasets in Bound-to-Bound Data Collaboration (Q4636381) (← links)
- A linear optimization-based method for data privacy in statistical tabular data (Q4646673) (← links)
- Constraint consensus concentration for identifying disjoint feasible regions in nonlinear programmes (Q4924119) (← links)
- Deletion Presolve for Accelerating Infeasibility Diagnosis in Optimization Models (Q5131703) (← links)
- Can linear superiorization be useful for linear optimization problems? (Q5346625) (← links)
- String-averaging projected subgradient methods for constrained minimization (Q5746721) (← links)
- K-best feasible clusters - ranking optimal solutions from an infeasible LP (Q5882398) (← links)
- The maximum feasible subset problem (maxFS) and applications (Q5884385) (← links)
- Bounded perturbation resilience of projected scaled gradient methods (Q5963677) (← links)
- Human-centred feasibility restoration in practice (Q6049434) (← links)
- Interactive approaches for biobjective problems with progressively changing solution sets (Q6070424) (← links)
- Finding preferred solutions under weighted Tchebycheff preference functions for multi-objective integer programs (Q6167407) (← links)
- Distributionally Favorable Optimization: A Framework for Data-Driven Decision-Making with Endogenous Outliers (Q6188509) (← links)
- Diagnosing infeasible optimization problems using large language models (Q6655267) (← links)
