Pages that link to "Item:Q1304175"

The following pages link to Practical bilevel optimization. Algorithms and applications (Q1304175):

Displaying 50 items.

• A genetic algorithm using a finite search space for solving nonlinear/linear fractional bilevel programming problems (Q256666) (← links)
• On solving multi-level multi objective linear programming problems through fuzzy goal programming approach (Q260647) (← links)
• On the solution of convex bilevel optimization problems (Q263155) (← links)
• Solving linear bilevel multiobjective programming problem via exact penalty function approach (Q265140) (← links)
• An algorithm based on particle swarm optimization for multiobjective bilevel linear problems (Q297775) (← links)
• Solving disjunctive optimization problems by generalized semi-infinite optimization techniques (Q301738) (← links)
• Joining the CCS club! The economics of CO\(_2\) pipeline projects (Q319970) (← links)
• Solving ill-posed bilevel programs (Q330322) (← links)
• The analysis of the behavior of generators in the two-level market model of functioning of the EPS (Q332337) (← links)
• Stochastic problem of competitive location of facilities with quantile criterion (Q334214) (← links)
• Solving quality control problems with an algorithm for minimax programs with coupled constraints (Q336795) (← links)
• Models and a relaxation algorithm for continuous network design problem with a tradable credit scheme and equity constraints (Q336802) (← links)
• Solution algorithm for an optimistic linear Stackelberg problem (Q336806) (← links)
• A trilevel programming approach for electric grid defense planning (Q336810) (← links)
• Relaxation approach for equilibrium problems with equilibrium constraints (Q336821) (← links)
• Finding optimal strategies in a multi-period multi-leader-follower Stackelberg game using an evolutionary algorithm (Q336830) (← links)
• Optimization of robust area traffic control with equilibrium flow under demand uncertainty (Q336835) (← links)
• The \(r\)-interdiction median problem with probabilistic protection and its solution algorithm (Q339605) (← links)
• \((r|p)\)-centroid problems on networks with vertex and edge demand (Q339626) (← links)
• A lower-bound formulation for the geometry and topology optimization of truss structures under multiple loading (Q382021) (← links)
• A bilevel programming problem with maximization of a supermodular function in the lower level (Q385481) (← links)
• Optimality conditions for optimistic bilevel programming problem using convexifactors (Q415386) (← links)
• Connections between single-level and bilevel multiobjective optimization (Q415423) (← links)
• Natural gas bilevel cash-out problem: convergence of a penalty function method (Q420861) (← links)
• Comment to ``Interactive fuzzy goal programming approach for bilevel programming problem'' by S.R. Arora and R. Gupta (Q421550) (← links)
• Generating equidistant representations in biobjective programming (Q429518) (← links)
• Linear bilevel programming with interval coefficients (Q432810) (← links)
• Sequential competitive location on networks (Q439407) (← links)
• An improved particle swarm optimization for solving bilevel multiobjective programming problem (Q442987) (← links)
• Bilevel problems over polyhedra with extreme point optimal solutions (Q453637) (← links)
• Bilevel stochastic linear programming problems with quantile criterion (Q463316) (← links)
• Complexity of fuzzy answer set programming under Łukasiewicz semantics (Q465597) (← links)
• Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development (Q480823) (← links)
• Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results (Q480824) (← links)
• Constraint qualifications for mathematical programs with equilibrium constraints and their local preservation property (Q481045) (← links)
• A smoothing method for solving bilevel multiobjective programming problems (Q489158) (← links)
• Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems (Q496609) (← links)
• Estimation of distribution algorithm for a class of nonlinear bilevel programming problems (Q497954) (← links)
• Enhanced exact algorithms for discrete bilevel linear problems (Q499703) (← links)
• Semantic-based regularization for learning and inference (Q511774) (← links)
• Global efficiency for multiobjective bilevel programming problems under generalized invexity (Q513525) (← links)
• A simple greedy heuristic for linear assignment interdiction (Q513608) (← links)
• Strategic design of competing supply chain networks with foresight (Q532462) (← links)
• A Dantzig-Wolfe decomposition based heuristic scheme for bi-level dynamic network design problem (Q539101) (← links)
• Direct search algorithm for bilevel programming problems (Q540635) (← links)
• An extended \(K\)th-best approach for linear bilevel programming (Q556123) (← links)
• An approximate programming method based on the simplex method for bilevel programming problem (Q604030) (← links)
• Integrated network capacity expansion and traffic signal optimization problem: Robust bi-level dynamic formulation (Q613549) (← links)
• Designing robust coverage networks to hedge against worst-case facility losses (Q617512) (← links)
• Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution (Q621684) (← links)