Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:3059325
Jump to:navigation, search

zbMath1229.90157MaRDI QIDQ3059325

Marc Demange, Jérôme Monnot

Publication date: 8 December 2010


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.


Mathematics Subject Classification ID

Combinatorial optimization (90C27)


Related Items (14)

Partial inverse min-max spanning tree problem ⋮ Algorithm for constraint partial inverse matroid problem with weight increase forbidden ⋮ Algorithms for the partial inverse matroid problem in which weights can only be increased ⋮ Inverse chromatic number problems in interval and permutation graphs ⋮ A simple algorithm and min-max formula for the inverse arborescence problem ⋮ A Discrete Convex Min-Max Formula for Box-TDI Polyhedra ⋮ Some inverse optimization problems on network ⋮ Objective-based counterfactual explanations for linear discrete optimization ⋮ On inverse traveling salesman problems ⋮ Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance ⋮ Weighted inverse maximum perfect matching problems under the Hamming distance ⋮ Reverse maximum flow problem under the weighted Chebyshev distance ⋮ Maximum Capacity Path Interdiction Problem with Fixed Costs ⋮ Inverse optimization problems with multiple weight functions




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3059325&oldid=16111156"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 22:46.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki